./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/mix037.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:19:15,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:19:15,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:19:15,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:19:15,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:19:15,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:19:15,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:19:15,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:19:15,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:19:15,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:19:15,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:19:15,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:19:15,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:19:15,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:19:15,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:19:15,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:19:15,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:19:15,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:19:15,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:19:15,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:19:15,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:19:15,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:19:15,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:19:15,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:19:15,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:19:15,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:19:15,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:19:15,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:19:15,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:19:15,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:19:15,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:19:15,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:19:15,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:19:15,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:19:15,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:19:15,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:19:15,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:19:15,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:19:15,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:19:15,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:19:15,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:19:15,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:19:15,476 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:19:15,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:19:15,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:19:15,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:19:15,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:19:15,477 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:19:15,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:19:15,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:19:15,478 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:19:15,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:19:15,478 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:19:15,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:19:15,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:19:15,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:19:15,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:19:15,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:19:15,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:19:15,485 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:19:15,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:19:15,485 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:19:15,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:19:15,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:19:15,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:19:15,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:19:15,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:19:15,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:19:15,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:19:15,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:19:15,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:19:15,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:19:15,487 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:19:15,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:19:15,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:19:15,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:19:15,488 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2021-12-17 22:19:15,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:19:15,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:19:15,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:19:15,776 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:19:15,776 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:19:15,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2021-12-17 22:19:15,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8845eb81c/9ba72314056c4162a7176b6692fd8ff0/FLAG2f2323841 [2021-12-17 22:19:16,301 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:19:16,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2021-12-17 22:19:16,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8845eb81c/9ba72314056c4162a7176b6692fd8ff0/FLAG2f2323841 [2021-12-17 22:19:16,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8845eb81c/9ba72314056c4162a7176b6692fd8ff0 [2021-12-17 22:19:16,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:19:16,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:19:16,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:19:16,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:19:16,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:19:16,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:19:16" (1/1) ... [2021-12-17 22:19:16,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826398c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:16, skipping insertion in model container [2021-12-17 22:19:16,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:19:16" (1/1) ... [2021-12-17 22:19:16,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:19:16,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:19:17,027 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/mix037.opt.i[944,957] [2021-12-17 22:19:17,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:19:17,254 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:19:17,267 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/mix037.opt.i[944,957] [2021-12-17 22:19:17,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:19:17,372 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:19:17,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17 WrapperNode [2021-12-17 22:19:17,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:19:17,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:19:17,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:19:17,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:19:17,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,454 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2021-12-17 22:19:17,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:19:17,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:19:17,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:19:17,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:19:17,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:19:17,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:19:17,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:19:17,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:19:17,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (1/1) ... [2021-12-17 22:19:17,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:19:17,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:19:17,548 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) [2021-12-17 22:19:17,569 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 [2021-12-17 22:19:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:19:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:19:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:19:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:19:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:19:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-17 22:19:17,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-17 22:19:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-17 22:19:17,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-17 22:19:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-17 22:19:17,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-17 22:19:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-17 22:19:17,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-17 22:19:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:19:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:19:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:19:17,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:19:17,588 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:19:17,724 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:19:17,729 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:19:18,170 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:19:18,392 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:19:18,392 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 22:19:18,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:19:18 BoogieIcfgContainer [2021-12-17 22:19:18,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:19:18,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:19:18,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:19:18,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:19:18,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:19:16" (1/3) ... [2021-12-17 22:19:18,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4e1cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:19:18, skipping insertion in model container [2021-12-17 22:19:18,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:19:17" (2/3) ... [2021-12-17 22:19:18,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4e1cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:19:18, skipping insertion in model container [2021-12-17 22:19:18,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:19:18" (3/3) ... [2021-12-17 22:19:18,402 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2021-12-17 22:19:18,407 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:19:18,407 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:19:18,408 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 22:19:18,408 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:19:18,458 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,458 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,458 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,459 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,459 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,459 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,459 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,460 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,460 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,461 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,461 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,461 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,461 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,462 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,462 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,462 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,463 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,463 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,463 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,464 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,464 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,464 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,465 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,465 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,465 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,465 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,466 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,466 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,466 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,466 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,466 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,466 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,467 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,467 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,467 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,467 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,467 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,468 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,468 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,468 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,468 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,469 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,469 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,469 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,469 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,469 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,470 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,470 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,470 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,470 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,470 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,471 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,471 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,471 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,471 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,472 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,472 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,472 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,472 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,473 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,473 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,473 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,473 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,473 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,474 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,474 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,474 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,475 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,475 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,475 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,478 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,478 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,479 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,481 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,482 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,482 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,482 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,483 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,491 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,491 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,491 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,491 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,491 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,492 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,492 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,492 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,492 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,492 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,492 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,493 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,493 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,493 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,493 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,493 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,493 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,494 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,494 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,494 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,494 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,496 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,496 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,496 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,497 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,498 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,498 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,498 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,499 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,499 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,499 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,499 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,499 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,499 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,500 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,500 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,500 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,500 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,500 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,501 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,501 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,501 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,501 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,503 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,503 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,503 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,503 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,503 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,504 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,504 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,504 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,504 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,505 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,505 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,513 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,513 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,514 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,514 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,515 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,515 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,515 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,516 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,516 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,516 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,516 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,516 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,517 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,517 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,517 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,517 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,517 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,517 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,518 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,518 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,519 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,521 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,521 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:19:18,522 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 22:19:18,579 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:19:18,586 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 22:19:18,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-17 22:19:18,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2021-12-17 22:19:18,640 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2021-12-17 22:19:18,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:19:18,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-12-17 22:19:18,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2021-12-17 22:19:18,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2021-12-17 22:19:18,665 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2021-12-17 22:19:18,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:19:18,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:18,666 INFO L254 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] [2021-12-17 22:19:18,667 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 201243862, now seen corresponding path program 1 times [2021-12-17 22:19:18,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852101457] [2021-12-17 22:19:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:18,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:18,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:18,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852101457] [2021-12-17 22:19:18,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852101457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:18,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:18,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:19:19,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045935373] [2021-12-17 22:19:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:19,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 22:19:19,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 22:19:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 22:19:19,043 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 137 [2021-12-17 22:19:19,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:19,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:19,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 137 [2021-12-17 22:19:19,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:19,137 INFO L129 PetriNetUnfolder]: 10/207 cut-off events. [2021-12-17 22:19:19,137 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-12-17 22:19:19,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 207 events. 10/207 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 389 event pairs, 4 based on Foata normal form. 6/204 useless extension candidates. Maximal degree in co-relation 191. Up to 17 conditions per place. [2021-12-17 22:19:19,140 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 9 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2021-12-17 22:19:19,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 131 transitions, 296 flow [2021-12-17 22:19:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 22:19:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 22:19:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2021-12-17 22:19:19,154 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2021-12-17 22:19:19,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2021-12-17 22:19:19,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2021-12-17 22:19:19,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:19,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2021-12-17 22:19:19,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:19,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:19,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:19,172 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2021-12-17 22:19:19,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 131 transitions, 296 flow [2021-12-17 22:19:19,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 131 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:19:19,218 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2021-12-17 22:19:19,220 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2021-12-17 22:19:19,225 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2021-12-17 22:19:19,226 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2021-12-17 22:19:19,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:19,226 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:19,227 INFO L254 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] [2021-12-17 22:19:19,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:19:19,227 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1834671337, now seen corresponding path program 1 times [2021-12-17 22:19:19,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:19,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918871000] [2021-12-17 22:19:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:19,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:19,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:19,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918871000] [2021-12-17 22:19:19,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918871000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:19,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:19,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:19:19,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752899198] [2021-12-17 22:19:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:19,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:19:19,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:19:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:19:19,548 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-17 22:19:19,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 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) [2021-12-17 22:19:19,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:19,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-17 22:19:19,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:20,847 INFO L129 PetriNetUnfolder]: 2392/6497 cut-off events. [2021-12-17 22:19:20,848 INFO L130 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2021-12-17 22:19:20,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10311 conditions, 6497 events. 2392/6497 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 61552 event pairs, 603 based on Foata normal form. 0/6345 useless extension candidates. Maximal degree in co-relation 10249. Up to 1639 conditions per place. [2021-12-17 22:19:20,898 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 30 selfloop transitions, 9 changer transitions 72/202 dead transitions. [2021-12-17 22:19:20,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 202 transitions, 630 flow [2021-12-17 22:19:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:19:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:19:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1072 transitions. [2021-12-17 22:19:20,903 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8694241686942417 [2021-12-17 22:19:20,903 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1072 transitions. [2021-12-17 22:19:20,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1072 transitions. [2021-12-17 22:19:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:20,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1072 transitions. [2021-12-17 22:19:20,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.11111111111111) internal successors, (1072), 9 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:20,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:20,912 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:20,912 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1072 transitions. [2021-12-17 22:19:20,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 202 transitions, 630 flow [2021-12-17 22:19:20,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 202 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:19:20,917 INFO L242 Difference]: Finished difference. Result has 154 places, 121 transitions, 348 flow [2021-12-17 22:19:20,918 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=348, PETRI_PLACES=154, PETRI_TRANSITIONS=121} [2021-12-17 22:19:20,919 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 10 predicate places. [2021-12-17 22:19:20,919 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 121 transitions, 348 flow [2021-12-17 22:19:20,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 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) [2021-12-17 22:19:20,920 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:20,920 INFO L254 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] [2021-12-17 22:19:20,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:19:20,921 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:20,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:20,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1975952054, now seen corresponding path program 1 times [2021-12-17 22:19:20,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:20,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737995903] [2021-12-17 22:19:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:20,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:21,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:21,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737995903] [2021-12-17 22:19:21,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737995903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:21,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:21,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:21,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419477256] [2021-12-17 22:19:21,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:21,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:21,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:21,082 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-17 22:19:21,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 121 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:21,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:21,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-17 22:19:21,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:22,033 INFO L129 PetriNetUnfolder]: 1501/3378 cut-off events. [2021-12-17 22:19:22,034 INFO L130 PetriNetUnfolder]: For 5465/5467 co-relation queries the response was YES. [2021-12-17 22:19:22,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10646 conditions, 3378 events. 1501/3378 cut-off events. For 5465/5467 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25718 event pairs, 219 based on Foata normal form. 75/3384 useless extension candidates. Maximal degree in co-relation 10572. Up to 1179 conditions per place. [2021-12-17 22:19:22,068 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 36 selfloop transitions, 8 changer transitions 73/208 dead transitions. [2021-12-17 22:19:22,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 208 transitions, 1146 flow [2021-12-17 22:19:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:19:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:19:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1507 transitions. [2021-12-17 22:19:22,073 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2021-12-17 22:19:22,073 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1507 transitions. [2021-12-17 22:19:22,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1507 transitions. [2021-12-17 22:19:22,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:22,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1507 transitions. [2021-12-17 22:19:22,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.92307692307692) internal successors, (1507), 13 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:22,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:22,083 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:22,083 INFO L186 Difference]: Start difference. First operand has 154 places, 121 transitions, 348 flow. Second operand 13 states and 1507 transitions. [2021-12-17 22:19:22,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 208 transitions, 1146 flow [2021-12-17 22:19:22,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 208 transitions, 1036 flow, removed 12 selfloop flow, removed 2 redundant places. [2021-12-17 22:19:22,110 INFO L242 Difference]: Finished difference. Result has 156 places, 125 transitions, 424 flow [2021-12-17 22:19:22,111 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=424, PETRI_PLACES=156, PETRI_TRANSITIONS=125} [2021-12-17 22:19:22,113 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 12 predicate places. [2021-12-17 22:19:22,113 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 125 transitions, 424 flow [2021-12-17 22:19:22,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:22,114 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:22,114 INFO L254 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] [2021-12-17 22:19:22,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:19:22,115 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1059977300, now seen corresponding path program 1 times [2021-12-17 22:19:22,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:22,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677663529] [2021-12-17 22:19:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:22,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:22,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677663529] [2021-12-17 22:19:22,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677663529] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:22,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:22,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:22,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156069189] [2021-12-17 22:19:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:22,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:22,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:22,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:22,284 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-17 22:19:22,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 125 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:22,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:22,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-17 22:19:22,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:23,110 INFO L129 PetriNetUnfolder]: 1171/2637 cut-off events. [2021-12-17 22:19:23,111 INFO L130 PetriNetUnfolder]: For 7816/7826 co-relation queries the response was YES. [2021-12-17 22:19:23,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9632 conditions, 2637 events. 1171/2637 cut-off events. For 7816/7826 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19019 event pairs, 309 based on Foata normal form. 55/2628 useless extension candidates. Maximal degree in co-relation 9548. Up to 941 conditions per place. [2021-12-17 22:19:23,145 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 40 selfloop transitions, 18 changer transitions 58/207 dead transitions. [2021-12-17 22:19:23,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 207 transitions, 1260 flow [2021-12-17 22:19:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:19:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:19:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1514 transitions. [2021-12-17 22:19:23,150 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8500842223469961 [2021-12-17 22:19:23,150 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1514 transitions. [2021-12-17 22:19:23,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1514 transitions. [2021-12-17 22:19:23,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:23,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1514 transitions. [2021-12-17 22:19:23,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.46153846153847) internal successors, (1514), 13 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:23,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:23,159 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:23,160 INFO L186 Difference]: Start difference. First operand has 156 places, 125 transitions, 424 flow. Second operand 13 states and 1514 transitions. [2021-12-17 22:19:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 207 transitions, 1260 flow [2021-12-17 22:19:23,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 207 transitions, 1177 flow, removed 39 selfloop flow, removed 7 redundant places. [2021-12-17 22:19:23,185 INFO L242 Difference]: Finished difference. Result has 163 places, 131 transitions, 547 flow [2021-12-17 22:19:23,185 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=547, PETRI_PLACES=163, PETRI_TRANSITIONS=131} [2021-12-17 22:19:23,186 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 19 predicate places. [2021-12-17 22:19:23,186 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 131 transitions, 547 flow [2021-12-17 22:19:23,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:23,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:23,187 INFO L254 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, 1, 1] [2021-12-17 22:19:23,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:19:23,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -17829693, now seen corresponding path program 1 times [2021-12-17 22:19:23,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053546931] [2021-12-17 22:19:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:23,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:23,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053546931] [2021-12-17 22:19:23,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053546931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:23,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:23,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:19:23,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436565245] [2021-12-17 22:19:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:23,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:19:23,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:23,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:19:23,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:19:23,304 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-17 22:19:23,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 131 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:23,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:23,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-17 22:19:23,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:25,554 INFO L129 PetriNetUnfolder]: 6523/12056 cut-off events. [2021-12-17 22:19:25,555 INFO L130 PetriNetUnfolder]: For 22662/26476 co-relation queries the response was YES. [2021-12-17 22:19:25,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31672 conditions, 12056 events. 6523/12056 cut-off events. For 22662/26476 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 105972 event pairs, 822 based on Foata normal form. 207/11286 useless extension candidates. Maximal degree in co-relation 31583. Up to 3927 conditions per place. [2021-12-17 22:19:25,712 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 72 selfloop transitions, 20 changer transitions 8/208 dead transitions. [2021-12-17 22:19:25,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 208 transitions, 1141 flow [2021-12-17 22:19:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:19:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:19:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1213 transitions. [2021-12-17 22:19:25,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8854014598540146 [2021-12-17 22:19:25,717 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1213 transitions. [2021-12-17 22:19:25,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1213 transitions. [2021-12-17 22:19:25,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:25,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1213 transitions. [2021-12-17 22:19:25,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.3) internal successors, (1213), 10 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:25,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:25,727 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:25,727 INFO L186 Difference]: Start difference. First operand has 163 places, 131 transitions, 547 flow. Second operand 10 states and 1213 transitions. [2021-12-17 22:19:25,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 208 transitions, 1141 flow [2021-12-17 22:19:25,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 208 transitions, 1021 flow, removed 60 selfloop flow, removed 15 redundant places. [2021-12-17 22:19:25,804 INFO L242 Difference]: Finished difference. Result has 154 places, 149 transitions, 624 flow [2021-12-17 22:19:25,805 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=624, PETRI_PLACES=154, PETRI_TRANSITIONS=149} [2021-12-17 22:19:25,807 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 10 predicate places. [2021-12-17 22:19:25,808 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 149 transitions, 624 flow [2021-12-17 22:19:25,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:25,808 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:25,809 INFO L254 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, 1, 1, 1, 1] [2021-12-17 22:19:25,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:19:25,809 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -985396970, now seen corresponding path program 1 times [2021-12-17 22:19:25,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:25,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061851323] [2021-12-17 22:19:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:25,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:25,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:25,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061851323] [2021-12-17 22:19:25,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061851323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:25,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:25,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:25,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717607917] [2021-12-17 22:19:25,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:25,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:25,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:25,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:25,967 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-17 22:19:25,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 149 transitions, 624 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:25,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:25,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-17 22:19:25,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:27,083 INFO L129 PetriNetUnfolder]: 2262/6830 cut-off events. [2021-12-17 22:19:27,083 INFO L130 PetriNetUnfolder]: For 11544/13130 co-relation queries the response was YES. [2021-12-17 22:19:27,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20660 conditions, 6830 events. 2262/6830 cut-off events. For 11544/13130 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 72454 event pairs, 786 based on Foata normal form. 119/6392 useless extension candidates. Maximal degree in co-relation 20573. Up to 1642 conditions per place. [2021-12-17 22:19:27,293 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 69 selfloop transitions, 22 changer transitions 0/200 dead transitions. [2021-12-17 22:19:27,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 200 transitions, 1147 flow [2021-12-17 22:19:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:19:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:19:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1162 transitions. [2021-12-17 22:19:27,297 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8481751824817518 [2021-12-17 22:19:27,297 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1162 transitions. [2021-12-17 22:19:27,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1162 transitions. [2021-12-17 22:19:27,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:27,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1162 transitions. [2021-12-17 22:19:27,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.2) internal successors, (1162), 10 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:27,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:27,305 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:27,306 INFO L186 Difference]: Start difference. First operand has 154 places, 149 transitions, 624 flow. Second operand 10 states and 1162 transitions. [2021-12-17 22:19:27,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 200 transitions, 1147 flow [2021-12-17 22:19:27,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 1145 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-17 22:19:27,344 INFO L242 Difference]: Finished difference. Result has 169 places, 157 transitions, 764 flow [2021-12-17 22:19:27,345 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=764, PETRI_PLACES=169, PETRI_TRANSITIONS=157} [2021-12-17 22:19:27,347 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 25 predicate places. [2021-12-17 22:19:27,347 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 157 transitions, 764 flow [2021-12-17 22:19:27,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:27,348 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:27,348 INFO L254 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, 1, 1, 1, 1] [2021-12-17 22:19:27,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:19:27,349 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 617771064, now seen corresponding path program 1 times [2021-12-17 22:19:27,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:27,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508888210] [2021-12-17 22:19:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:27,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:27,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508888210] [2021-12-17 22:19:27,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508888210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:27,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:27,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:27,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69838868] [2021-12-17 22:19:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:27,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:27,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:27,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:27,481 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-17 22:19:27,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 157 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:27,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:27,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-17 22:19:27,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:29,882 INFO L129 PetriNetUnfolder]: 8490/16183 cut-off events. [2021-12-17 22:19:29,882 INFO L130 PetriNetUnfolder]: For 44463/48950 co-relation queries the response was YES. [2021-12-17 22:19:30,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58934 conditions, 16183 events. 8490/16183 cut-off events. For 44463/48950 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 154401 event pairs, 487 based on Foata normal form. 688/16082 useless extension candidates. Maximal degree in co-relation 58841. Up to 4948 conditions per place. [2021-12-17 22:19:30,204 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 78 selfloop transitions, 30 changer transitions 32/256 dead transitions. [2021-12-17 22:19:30,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 256 transitions, 1704 flow [2021-12-17 22:19:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:19:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:19:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1580 transitions. [2021-12-17 22:19:30,210 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8871420550252667 [2021-12-17 22:19:30,210 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1580 transitions. [2021-12-17 22:19:30,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1580 transitions. [2021-12-17 22:19:30,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:30,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1580 transitions. [2021-12-17 22:19:30,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.53846153846153) internal successors, (1580), 13 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:30,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:30,219 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:30,219 INFO L186 Difference]: Start difference. First operand has 169 places, 157 transitions, 764 flow. Second operand 13 states and 1580 transitions. [2021-12-17 22:19:30,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 256 transitions, 1704 flow [2021-12-17 22:19:30,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 256 transitions, 1644 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-12-17 22:19:30,362 INFO L242 Difference]: Finished difference. Result has 186 places, 169 transitions, 956 flow [2021-12-17 22:19:30,363 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=956, PETRI_PLACES=186, PETRI_TRANSITIONS=169} [2021-12-17 22:19:30,364 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 42 predicate places. [2021-12-17 22:19:30,364 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 169 transitions, 956 flow [2021-12-17 22:19:30,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:30,365 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:30,365 INFO L254 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:30,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:19:30,366 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash -797246224, now seen corresponding path program 1 times [2021-12-17 22:19:30,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:30,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001654304] [2021-12-17 22:19:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:30,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:30,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001654304] [2021-12-17 22:19:30,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001654304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:30,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:30,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:19:30,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185750164] [2021-12-17 22:19:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:30,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:19:30,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:19:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:19:30,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-17 22:19:30,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 169 transitions, 956 flow. Second operand has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:30,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:30,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-17 22:19:30,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:32,083 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][169], [Black: 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), 251#true, Black: 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 107#L801true, 276#(= ~x~0 1), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork0InUse, Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, 8#L867-1true, Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 80#L839true, Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), 346#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 216#true]) [2021-12-17 22:19:32,084 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-17 22:19:32,084 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-17 22:19:32,084 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-17 22:19:32,084 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-17 22:19:32,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][169], [Black: 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), 251#true, Black: 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 107#L801true, 276#(= ~x~0 1), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork0InUse, Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 80#L839true, 70#L2true, Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), 346#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 216#true]) [2021-12-17 22:19:32,244 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,244 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,245 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,245 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,246 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][217], [Black: 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 319#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), 251#true, Black: 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 276#(= ~x~0 1), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork0InUse, Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, 8#L867-1true, Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 37#L806true, Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 80#L839true, Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 352#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 216#true]) [2021-12-17 22:19:32,246 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,246 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,247 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,247 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-17 22:19:32,534 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][187], [350#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), 251#true, Black: 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 107#L801true, 276#(= ~x~0 1), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork0InUse, Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), 80#L839true, Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 62#L3true, Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 216#true]) [2021-12-17 22:19:32,535 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,535 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,535 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,535 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][217], [Black: 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 319#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), 251#true, Black: 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 276#(= ~x~0 1), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), P3Thread1of1ForFork0InUse, Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 37#L806true, Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 80#L839true, 70#L2true, Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 352#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 216#true]) [2021-12-17 22:19:32,536 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,536 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,536 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,536 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-17 22:19:32,649 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][187], [350#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), Black: 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 107#L801true, 276#(= ~x~0 1), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), Black: 251#true, 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork0InUse, Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, 256#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 80#L839true, Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 135#L3-1true, 216#true]) [2021-12-17 22:19:32,649 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,649 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,649 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,650 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,650 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][238], [Black: 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), 251#true, Black: 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 276#(= ~x~0 1), 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 182#(= ~__unbuffered_p3_EAX~0 0), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork0InUse, Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, 354#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 37#L806true, Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), 80#L839true, Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), 62#L3true, Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 216#true]) [2021-12-17 22:19:32,651 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,651 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,651 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,651 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-17 22:19:32,741 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([854] L832-->L839: Formula: (let ((.cse3 (= 0 (mod v_~z$w_buff0_used~0_293 256))) (.cse13 (= 0 (mod v_~z$w_buff1_used~0_194 256))) (.cse5 (= 0 (mod v_~z$r_buff1_thd4~0_46 256))) (.cse12 (= 0 (mod v_~z$r_buff0_thd4~0_73 256))) (.cse14 (= 0 (mod v_~z$w_buff0_used~0_294 256)))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse12 .cse14)) (.cse7 (not .cse5)) (.cse9 (not .cse13)) (.cse1 (not .cse3)) (.cse2 (not .cse12)) (.cse10 (or .cse5 .cse13)) (.cse0 (or .cse3 .cse12))) (and (or (and .cse0 (= v_~z$r_buff0_thd4~0_72 v_~z$r_buff0_thd4~0_73)) (and .cse1 .cse2 (= v_~z$r_buff0_thd4~0_72 0))) (let ((.cse6 (= 0 (mod v_~z$w_buff1_used~0_193 256))) (.cse4 (= 0 (mod v_~z$r_buff0_thd4~0_72 256)))) (or (and (or .cse3 .cse4) (= v_~z$r_buff1_thd4~0_45 v_~z$r_buff1_thd4~0_46) (or .cse5 .cse6)) (and (= v_~z$r_buff1_thd4~0_45 0) (or (and .cse7 (not .cse6)) (and .cse1 (not .cse4)))))) (or (and (= v_~z~0_82 v_~z$w_buff0~0_52) .cse2 .cse8 (= |v_P3Thread1of1ForFork0_#t~ite26#1_1| |v_P3_#t~ite26#1_33|)) (and (= v_~z~0_82 |v_P3_#t~ite26#1_33|) (or (and .cse7 (= |v_P3_#t~ite26#1_33| v_~z$w_buff1~0_59) .cse9) (and (= |v_P3_#t~ite26#1_33| v_~z~0_83) .cse10)) .cse11)) (or (and .cse2 .cse8 (= v_~z$w_buff0_used~0_293 0)) (and (= v_~z$w_buff0_used~0_293 v_~z$w_buff0_used~0_294) .cse11)) (or (and (= v_~z$w_buff1_used~0_193 0) (or (and .cse7 .cse9) (and .cse1 .cse2))) (and (= v_~z$w_buff1_used~0_193 v_~z$w_buff1_used~0_194) .cse10 .cse0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_46, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_294, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_59, ~z~0=v_~z~0_83} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~z$w_buff0~0=v_~z$w_buff0~0_52, P3Thread1of1ForFork0_#t~ite26#1=|v_P3Thread1of1ForFork0_#t~ite26#1_2|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_59, P3Thread1of1ForFork0_#t~ite29#1=|v_P3Thread1of1ForFork0_#t~ite29#1_1|, P3Thread1of1ForFork0_#t~ite31#1=|v_P3Thread1of1ForFork0_#t~ite31#1_1|, P3Thread1of1ForFork0_#t~ite27#1=|v_P3Thread1of1ForFork0_#t~ite27#1_1|, P3Thread1of1ForFork0_#t~ite28#1=|v_P3Thread1of1ForFork0_#t~ite28#1_1|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z~0=v_~z~0_82, P3Thread1of1ForFork0_#t~ite30#1=|v_P3Thread1of1ForFork0_#t~ite30#1_1|} AuxVars[|v_P3_#t~ite26#1_33|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P3Thread1of1ForFork0_#t~ite27#1, P3Thread1of1ForFork0_#t~ite26#1, ~z$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite28#1, ~z$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite29#1, ~z~0, P3Thread1of1ForFork0_#t~ite31#1, P3Thread1of1ForFork0_#t~ite30#1][238], [Black: 317#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 299#true, Black: 303#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), Black: 309#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1)), Black: 313#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 276#(= ~x~0 1), Black: 182#(= ~__unbuffered_p3_EAX~0 0), 321#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 260#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 183#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), Black: 251#true, 54#L763true, Black: 266#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 254#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0)), P3Thread1of1ForFork0InUse, Black: 264#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 258#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 180#true, 354#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~main$tmp_guard0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 256#(and (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 278#(and (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~main$tmp_guard1~0)), 37#L806true, Black: 288#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 282#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), 80#L839true, Black: 286#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 284#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~x~0 1) (<= 1 ~main$tmp_guard1~0)), Black: 290#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (<= 1 ~main$tmp_guard1~0)), Black: 162#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 157#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 57#L773true, Black: 168#(and (or (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))) (<= 1 ~main$tmp_guard1~0)), Black: 218#(= ~x~0 0), Black: 219#(or (not (= 2 ~x~0)) (not (= 1 ~__unbuffered_p3_EAX~0)) (not (= 0 ~__unbuffered_p2_EAX~0)) (not (= 0 ~__unbuffered_p1_EAX~0)) (not (= 0 ~__unbuffered_p3_EBX~0))), 135#L3-1true, 216#true]) [2021-12-17 22:19:32,741 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-17 22:19:32,742 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-17 22:19:32,742 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-17 22:19:32,742 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-17 22:19:32,888 INFO L129 PetriNetUnfolder]: 7332/15466 cut-off events. [2021-12-17 22:19:32,888 INFO L130 PetriNetUnfolder]: For 71341/76650 co-relation queries the response was YES. [2021-12-17 22:19:33,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66955 conditions, 15466 events. 7332/15466 cut-off events. For 71341/76650 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 162258 event pairs, 230 based on Foata normal form. 918/15696 useless extension candidates. Maximal degree in co-relation 66855. Up to 4651 conditions per place. [2021-12-17 22:19:33,077 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 89 selfloop transitions, 48 changer transitions 38/283 dead transitions. [2021-12-17 22:19:33,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 283 transitions, 2194 flow [2021-12-17 22:19:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:19:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:19:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1940 transitions. [2021-12-17 22:19:33,083 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.885036496350365 [2021-12-17 22:19:33,083 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1940 transitions. [2021-12-17 22:19:33,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1940 transitions. [2021-12-17 22:19:33,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:33,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1940 transitions. [2021-12-17 22:19:33,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.25) internal successors, (1940), 16 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:33,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:33,093 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:33,093 INFO L186 Difference]: Start difference. First operand has 186 places, 169 transitions, 956 flow. Second operand 16 states and 1940 transitions. [2021-12-17 22:19:33,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 283 transitions, 2194 flow [2021-12-17 22:19:34,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 283 transitions, 2089 flow, removed 43 selfloop flow, removed 5 redundant places. [2021-12-17 22:19:34,445 INFO L242 Difference]: Finished difference. Result has 200 places, 185 transitions, 1197 flow [2021-12-17 22:19:34,445 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1197, PETRI_PLACES=200, PETRI_TRANSITIONS=185} [2021-12-17 22:19:34,446 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 56 predicate places. [2021-12-17 22:19:34,446 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 185 transitions, 1197 flow [2021-12-17 22:19:34,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:34,447 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:34,447 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:34,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:19:34,447 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1214511428, now seen corresponding path program 1 times [2021-12-17 22:19:34,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:34,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917057866] [2021-12-17 22:19:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:34,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:34,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:34,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917057866] [2021-12-17 22:19:34,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917057866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:34,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:34,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:34,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341162450] [2021-12-17 22:19:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:34,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:34,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:34,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:34,575 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2021-12-17 22:19:34,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 185 transitions, 1197 flow. Second operand has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:34,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:34,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2021-12-17 22:19:34,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:36,081 INFO L129 PetriNetUnfolder]: 2640/9834 cut-off events. [2021-12-17 22:19:36,082 INFO L130 PetriNetUnfolder]: For 45819/47920 co-relation queries the response was YES. [2021-12-17 22:19:36,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36530 conditions, 9834 events. 2640/9834 cut-off events. For 45819/47920 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 127364 event pairs, 77 based on Foata normal form. 17/9237 useless extension candidates. Maximal degree in co-relation 36421. Up to 2415 conditions per place. [2021-12-17 22:19:36,294 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 53 selfloop transitions, 25 changer transitions 21/242 dead transitions. [2021-12-17 22:19:36,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 242 transitions, 1798 flow [2021-12-17 22:19:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:19:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:19:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1251 transitions. [2021-12-17 22:19:36,299 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8301260783012607 [2021-12-17 22:19:36,299 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1251 transitions. [2021-12-17 22:19:36,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1251 transitions. [2021-12-17 22:19:36,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:36,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1251 transitions. [2021-12-17 22:19:36,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:36,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:36,307 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:36,307 INFO L186 Difference]: Start difference. First operand has 200 places, 185 transitions, 1197 flow. Second operand 11 states and 1251 transitions. [2021-12-17 22:19:36,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 242 transitions, 1798 flow [2021-12-17 22:19:38,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 242 transitions, 1451 flow, removed 140 selfloop flow, removed 17 redundant places. [2021-12-17 22:19:38,003 INFO L242 Difference]: Finished difference. Result has 195 places, 194 transitions, 1104 flow [2021-12-17 22:19:38,003 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1104, PETRI_PLACES=195, PETRI_TRANSITIONS=194} [2021-12-17 22:19:38,004 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 51 predicate places. [2021-12-17 22:19:38,004 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 194 transitions, 1104 flow [2021-12-17 22:19:38,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:38,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:38,005 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:38,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:19:38,006 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -809938198, now seen corresponding path program 2 times [2021-12-17 22:19:38,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:38,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346054083] [2021-12-17 22:19:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:38,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:38,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346054083] [2021-12-17 22:19:38,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346054083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:38,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:38,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:38,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430945479] [2021-12-17 22:19:38,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:38,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:38,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:38,104 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-17 22:19:38,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 194 transitions, 1104 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:38,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:38,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-17 22:19:38,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:39,388 INFO L129 PetriNetUnfolder]: 3280/11556 cut-off events. [2021-12-17 22:19:39,388 INFO L130 PetriNetUnfolder]: For 16884/17301 co-relation queries the response was YES. [2021-12-17 22:19:39,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29868 conditions, 11556 events. 3280/11556 cut-off events. For 16884/17301 co-relation queries the response was YES. Maximal size of possible extension queue 1412. Compared 154331 event pairs, 60 based on Foata normal form. 14/10975 useless extension candidates. Maximal degree in co-relation 29763. Up to 1331 conditions per place. [2021-12-17 22:19:39,475 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 42 selfloop transitions, 4 changer transitions 11/224 dead transitions. [2021-12-17 22:19:39,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 224 transitions, 1438 flow [2021-12-17 22:19:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:19:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:19:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2021-12-17 22:19:39,478 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2021-12-17 22:19:39,478 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2021-12-17 22:19:39,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2021-12-17 22:19:39,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:39,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2021-12-17 22:19:39,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:39,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:39,483 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:39,484 INFO L186 Difference]: Start difference. First operand has 195 places, 194 transitions, 1104 flow. Second operand 7 states and 847 transitions. [2021-12-17 22:19:39,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 224 transitions, 1438 flow [2021-12-17 22:19:40,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 224 transitions, 1352 flow, removed 43 selfloop flow, removed 6 redundant places. [2021-12-17 22:19:40,038 INFO L242 Difference]: Finished difference. Result has 193 places, 193 transitions, 1083 flow [2021-12-17 22:19:40,038 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1083, PETRI_PLACES=193, PETRI_TRANSITIONS=193} [2021-12-17 22:19:40,039 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 49 predicate places. [2021-12-17 22:19:40,039 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 193 transitions, 1083 flow [2021-12-17 22:19:40,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:40,039 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:40,040 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:40,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:19:40,040 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -760236008, now seen corresponding path program 3 times [2021-12-17 22:19:40,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:40,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850625360] [2021-12-17 22:19:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:40,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:40,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:40,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850625360] [2021-12-17 22:19:40,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850625360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:40,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:40,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:19:40,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689216753] [2021-12-17 22:19:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:40,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:19:40,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:40,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:19:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:19:40,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-17 22:19:40,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 193 transitions, 1083 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:40,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:40,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-17 22:19:40,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:44,116 INFO L129 PetriNetUnfolder]: 11925/26098 cut-off events. [2021-12-17 22:19:44,117 INFO L130 PetriNetUnfolder]: For 72621/83028 co-relation queries the response was YES. [2021-12-17 22:19:44,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91304 conditions, 26098 events. 11925/26098 cut-off events. For 72621/83028 co-relation queries the response was YES. Maximal size of possible extension queue 2334. Compared 303648 event pairs, 371 based on Foata normal form. 1198/26475 useless extension candidates. Maximal degree in co-relation 91267. Up to 3122 conditions per place. [2021-12-17 22:19:44,381 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 49 selfloop transitions, 43 changer transitions 105/295 dead transitions. [2021-12-17 22:19:44,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 295 transitions, 2266 flow [2021-12-17 22:19:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 22:19:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-17 22:19:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2270 transitions. [2021-12-17 22:19:44,386 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8720706876680753 [2021-12-17 22:19:44,386 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2270 transitions. [2021-12-17 22:19:44,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2270 transitions. [2021-12-17 22:19:44,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:44,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2270 transitions. [2021-12-17 22:19:44,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.47368421052632) internal successors, (2270), 19 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:44,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:44,398 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:44,398 INFO L186 Difference]: Start difference. First operand has 193 places, 193 transitions, 1083 flow. Second operand 19 states and 2270 transitions. [2021-12-17 22:19:44,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 295 transitions, 2266 flow [2021-12-17 22:19:46,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 295 transitions, 2155 flow, removed 52 selfloop flow, removed 5 redundant places. [2021-12-17 22:19:46,372 INFO L242 Difference]: Finished difference. Result has 210 places, 162 transitions, 874 flow [2021-12-17 22:19:46,372 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=874, PETRI_PLACES=210, PETRI_TRANSITIONS=162} [2021-12-17 22:19:46,372 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 66 predicate places. [2021-12-17 22:19:46,372 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 162 transitions, 874 flow [2021-12-17 22:19:46,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:46,373 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:46,373 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:46,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 22:19:46,374 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1999778396, now seen corresponding path program 1 times [2021-12-17 22:19:46,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:46,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892208128] [2021-12-17 22:19:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:46,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:46,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:46,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892208128] [2021-12-17 22:19:46,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892208128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:46,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:46,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:46,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011301832] [2021-12-17 22:19:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:46,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:46,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:46,510 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2021-12-17 22:19:46,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 162 transitions, 874 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:46,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:46,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2021-12-17 22:19:46,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:46,926 INFO L129 PetriNetUnfolder]: 654/2880 cut-off events. [2021-12-17 22:19:46,926 INFO L130 PetriNetUnfolder]: For 6203/6425 co-relation queries the response was YES. [2021-12-17 22:19:46,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8683 conditions, 2880 events. 654/2880 cut-off events. For 6203/6425 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 31790 event pairs, 12 based on Foata normal form. 1/2751 useless extension candidates. Maximal degree in co-relation 8619. Up to 327 conditions per place. [2021-12-17 22:19:46,959 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 26 selfloop transitions, 14 changer transitions 13/184 dead transitions. [2021-12-17 22:19:46,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 184 transitions, 1137 flow [2021-12-17 22:19:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 22:19:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-17 22:19:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2021-12-17 22:19:46,962 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8193430656934306 [2021-12-17 22:19:46,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2021-12-17 22:19:46,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2021-12-17 22:19:46,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:46,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2021-12-17 22:19:46,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:46,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:46,968 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:46,968 INFO L186 Difference]: Start difference. First operand has 210 places, 162 transitions, 874 flow. Second operand 8 states and 898 transitions. [2021-12-17 22:19:46,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 184 transitions, 1137 flow [2021-12-17 22:19:47,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 184 transitions, 881 flow, removed 60 selfloop flow, removed 29 redundant places. [2021-12-17 22:19:47,037 INFO L242 Difference]: Finished difference. Result has 183 places, 165 transitions, 764 flow [2021-12-17 22:19:47,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=764, PETRI_PLACES=183, PETRI_TRANSITIONS=165} [2021-12-17 22:19:47,038 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 39 predicate places. [2021-12-17 22:19:47,038 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 165 transitions, 764 flow [2021-12-17 22:19:47,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,039 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:47,039 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:47,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 22:19:47,039 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash 368710094, now seen corresponding path program 2 times [2021-12-17 22:19:47,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:47,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510911836] [2021-12-17 22:19:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:47,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:47,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:47,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510911836] [2021-12-17 22:19:47,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510911836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:47,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:47,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:19:47,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790507805] [2021-12-17 22:19:47,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:47,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:19:47,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:19:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:19:47,149 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-17 22:19:47,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 165 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:47,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-17 22:19:47,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:47,487 INFO L129 PetriNetUnfolder]: 655/2537 cut-off events. [2021-12-17 22:19:47,487 INFO L130 PetriNetUnfolder]: For 3669/3758 co-relation queries the response was YES. [2021-12-17 22:19:47,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 2537 events. 655/2537 cut-off events. For 3669/3758 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 26687 event pairs, 3 based on Foata normal form. 1/2391 useless extension candidates. Maximal degree in co-relation 6889. Up to 316 conditions per place. [2021-12-17 22:19:47,505 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 23 selfloop transitions, 3 changer transitions 5/174 dead transitions. [2021-12-17 22:19:47,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 174 transitions, 852 flow [2021-12-17 22:19:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:19:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:19:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2021-12-17 22:19:47,507 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8633993743482794 [2021-12-17 22:19:47,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2021-12-17 22:19:47,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2021-12-17 22:19:47,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:47,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2021-12-17 22:19:47,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,510 INFO L186 Difference]: Start difference. First operand has 183 places, 165 transitions, 764 flow. Second operand 7 states and 828 transitions. [2021-12-17 22:19:47,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 174 transitions, 852 flow [2021-12-17 22:19:47,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 815 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-12-17 22:19:47,572 INFO L242 Difference]: Finished difference. Result has 183 places, 165 transitions, 746 flow [2021-12-17 22:19:47,573 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=746, PETRI_PLACES=183, PETRI_TRANSITIONS=165} [2021-12-17 22:19:47,573 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 39 predicate places. [2021-12-17 22:19:47,573 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 165 transitions, 746 flow [2021-12-17 22:19:47,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,574 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:47,574 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:47,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 22:19:47,574 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash 915569688, now seen corresponding path program 3 times [2021-12-17 22:19:47,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:47,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970317926] [2021-12-17 22:19:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:47,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:19:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:19:47,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:19:47,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970317926] [2021-12-17 22:19:47,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970317926] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:19:47,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:19:47,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:19:47,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390230363] [2021-12-17 22:19:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:19:47,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:19:47,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:19:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:19:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:19:47,774 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-17 22:19:47,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 165 transitions, 746 flow. Second operand has 9 states, 9 states have (on average 113.33333333333333) internal successors, (1020), 9 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:47,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:19:47,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-17 22:19:47,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:19:48,167 INFO L129 PetriNetUnfolder]: 961/3507 cut-off events. [2021-12-17 22:19:48,167 INFO L130 PetriNetUnfolder]: For 5175/5240 co-relation queries the response was YES. [2021-12-17 22:19:48,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9685 conditions, 3507 events. 961/3507 cut-off events. For 5175/5240 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 39039 event pairs, 4 based on Foata normal form. 1/3302 useless extension candidates. Maximal degree in co-relation 9655. Up to 468 conditions per place. [2021-12-17 22:19:48,186 INFO L132 encePairwiseOnDemand]: 128/137 looper letters, 17 selfloop transitions, 5 changer transitions 46/173 dead transitions. [2021-12-17 22:19:48,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 173 transitions, 849 flow [2021-12-17 22:19:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:19:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:19:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1138 transitions. [2021-12-17 22:19:48,188 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8306569343065694 [2021-12-17 22:19:48,188 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1138 transitions. [2021-12-17 22:19:48,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1138 transitions. [2021-12-17 22:19:48,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:19:48,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1138 transitions. [2021-12-17 22:19:48,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.8) internal successors, (1138), 10 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:48,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:48,192 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:48,193 INFO L186 Difference]: Start difference. First operand has 183 places, 165 transitions, 746 flow. Second operand 10 states and 1138 transitions. [2021-12-17 22:19:48,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 173 transitions, 849 flow [2021-12-17 22:19:48,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 173 transitions, 837 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-17 22:19:48,292 INFO L242 Difference]: Finished difference. Result has 190 places, 127 transitions, 455 flow [2021-12-17 22:19:48,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=455, PETRI_PLACES=190, PETRI_TRANSITIONS=127} [2021-12-17 22:19:48,293 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 46 predicate places. [2021-12-17 22:19:48,293 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 127 transitions, 455 flow [2021-12-17 22:19:48,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.33333333333333) internal successors, (1020), 9 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:19:48,294 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:19:48,294 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:48,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 22:19:48,295 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-17 22:19:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:19:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1348120654, now seen corresponding path program 4 times [2021-12-17 22:19:48,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:19:48,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949097624] [2021-12-17 22:19:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:19:48,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:19:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:19:48,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 22:19:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:19:48,425 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 22:19:48,426 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 22:19:48,426 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-17 22:19:48,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-17 22:19:48,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-17 22:19:48,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-17 22:19:48,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-17 22:19:48,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-17 22:19:48,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-17 22:19:48,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 22:19:48,433 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:19:48,438 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-17 22:19:48,438 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 22:19:48,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:19:48 BasicIcfg [2021-12-17 22:19:48,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 22:19:48,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 22:19:48,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 22:19:48,602 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 22:19:48,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:19:18" (3/4) ... [2021-12-17 22:19:48,605 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 22:19:48,725 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 22:19:48,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 22:19:48,727 INFO L158 Benchmark]: Toolchain (without parser) took 31914.37ms. Allocated memory was 117.4MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 87.3MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-17 22:19:48,727 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:19:48,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.36ms. Allocated memory is still 117.4MB. Free memory was 87.3MB in the beginning and 82.1MB in the end (delta: 5.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 22:19:48,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.56ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 79.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:19:48,728 INFO L158 Benchmark]: Boogie Preprocessor took 57.11ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 77.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:19:48,728 INFO L158 Benchmark]: RCFGBuilder took 880.94ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 54.6MB in the end (delta: 22.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-12-17 22:19:48,728 INFO L158 Benchmark]: TraceAbstraction took 30205.12ms. Allocated memory was 117.4MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 54.1MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-17 22:19:48,731 INFO L158 Benchmark]: Witness Printer took 123.56ms. Allocated memory is still 8.7GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2021-12-17 22:19:48,733 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.10ms. Allocated memory is still 94.4MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.36ms. Allocated memory is still 117.4MB. Free memory was 87.3MB in the beginning and 82.1MB in the end (delta: 5.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.56ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 79.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.11ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 77.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 880.94ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 54.6MB in the end (delta: 22.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30205.12ms. Allocated memory was 117.4MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 54.1MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 123.56ms. Allocated memory is still 8.7GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L856] 0 pthread_t t973; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=-3, t973={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L858] 0 pthread_t t974; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=-2, t973={5:0}, t974={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L860] 0 pthread_t t975; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=-1, t973={5:0}, t974={6:0}, t975={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L862] 0 pthread_t t976; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L791] 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) [L792] 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)) [L792] 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) [L792] 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)) [L792] 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)) [L793] 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)) [L793] 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) [L793] 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)) [L793] 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)) [L794] 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)) [L794] 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) [L794] 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)) [L794] 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)) [L795] 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)) [L795] 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) [L795] 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)) [L795] 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)) [L796] 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)) [L796] 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) [L796] 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)) [L796] 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)) [L797] 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)) [L797] 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) [L797] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L869] 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) [L869] 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) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 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 [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 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 [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 863]: 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: 859]: 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: 861]: 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: 857]: 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 9 procedures, 172 locations, 7 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: 29.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1505 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1733 IncrementalHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 223 mSDtfsCounter, 1733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1197occurred in iteration=8, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1450 NumberOfCodeBlocks, 1450 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 5398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 22:19:48,774 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