./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-16 02:48:35,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:48:35,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:48:35,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:48:35,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:48:35,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:48:35,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:48:35,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:48:35,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:48:35,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:48:35,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:48:35,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:48:35,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:48:35,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:48:35,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:48:35,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:48:35,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:48:35,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:48:35,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:48:35,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:48:35,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:48:35,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:48:35,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:48:35,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:48:35,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:48:35,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:48:35,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:48:35,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:48:35,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:48:35,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:48:35,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:48:35,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:48:35,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:48:35,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:48:35,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:48:35,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:48:35,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:48:35,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:48:35,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:48:35,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:48:35,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:48:35,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:48:35,798 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:48:35,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:48:35,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:48:35,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:48:35,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:48:35,800 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:48:35,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:48:35,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:48:35,800 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:48:35,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:48:35,801 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:48:35,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:48:35,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:48:35,803 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:48:35,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:48:35,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:48:35,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:48:35,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:48:35,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:48:35,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:48:35,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:48:35,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:48:35,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:48:35,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:48:35,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:48:35,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:48:35,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:48:35,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:48:35,805 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-16 02:48:36,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:48:36,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:48:36,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:48:36,040 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:48:36,040 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:48:36,041 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-16 02:48:36,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb8017d72/83b9a6bfa32b463abd6148d401724e12/FLAGc207c6f40 [2021-12-16 02:48:36,482 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:48:36,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2021-12-16 02:48:36,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb8017d72/83b9a6bfa32b463abd6148d401724e12/FLAGc207c6f40 [2021-12-16 02:48:36,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb8017d72/83b9a6bfa32b463abd6148d401724e12 [2021-12-16 02:48:36,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:48:36,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:48:36,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:48:36,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:48:36,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:48:36,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:48:36" (1/1) ... [2021-12-16 02:48:36,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257b88fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:36, skipping insertion in model container [2021-12-16 02:48:36,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:48:36" (1/1) ... [2021-12-16 02:48:36,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:48:36,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:48:37,105 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-16 02:48:37,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:48:37,305 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:48:37,318 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-16 02:48:37,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:48:37,399 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:48:37,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37 WrapperNode [2021-12-16 02:48:37,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:48:37,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:48:37,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:48:37,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:48:37,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,461 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2021-12-16 02:48:37,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:48:37,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:48:37,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:48:37,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:48:37,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:48:37,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:48:37,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:48:37,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:48:37,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (1/1) ... [2021-12-16 02:48:37,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:48:37,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:48:37,561 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-16 02:48:37,625 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-16 02:48:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 02:48:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-16 02:48:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:48:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 02:48:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 02:48:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-16 02:48:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-16 02:48:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-16 02:48:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-16 02:48:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-16 02:48:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-16 02:48:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-16 02:48:37,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-16 02:48:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:48:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-16 02:48:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:48:37,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:48:37,665 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 02:48:37,776 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:48:37,778 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:48:38,164 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:48:38,475 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:48:38,475 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 02:48:38,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:48:38 BoogieIcfgContainer [2021-12-16 02:48:38,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:48:38,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:48:38,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:48:38,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:48:38,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:48:36" (1/3) ... [2021-12-16 02:48:38,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b144c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:48:38, skipping insertion in model container [2021-12-16 02:48:38,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:48:37" (2/3) ... [2021-12-16 02:48:38,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b144c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:48:38, skipping insertion in model container [2021-12-16 02:48:38,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:48:38" (3/3) ... [2021-12-16 02:48:38,496 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2021-12-16 02:48:38,500 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 02:48:38,500 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:48:38,500 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-16 02:48:38,500 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 02:48:38,538 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,539 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,539 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,539 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,540 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,540 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,540 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,541 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,541 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,541 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,541 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,542 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,542 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,542 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,543 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,543 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,544 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,544 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,544 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,544 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,544 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,544 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,545 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,545 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,545 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,546 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,546 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,546 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,549 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,550 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,551 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,559 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,560 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,561 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,562 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,566 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,567 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,567 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,567 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,568 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,568 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,568 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,569 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,569 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,569 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,569 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,569 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,570 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,570 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,570 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,570 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,574 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,574 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,575 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,575 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:48:38,575 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-16 02:48:38,620 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:48:38,631 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-16 02:48:38,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-16 02:48:38,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2021-12-16 02:48:38,696 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2021-12-16 02:48:38,697 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:48:38,702 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-16 02:48:38,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2021-12-16 02:48:38,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2021-12-16 02:48:38,724 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2021-12-16 02:48:38,724 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:48:38,724 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:38,724 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-16 02:48:38,725 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:48:38,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:38,729 INFO L85 PathProgramCache]: Analyzing trace with hash 201243862, now seen corresponding path program 1 times [2021-12-16 02:48:38,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:38,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786563368] [2021-12-16 02:48:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:38,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:39,043 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-16 02:48:39,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:39,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786563368] [2021-12-16 02:48:39,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786563368] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:39,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:39,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 02:48:39,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647575186] [2021-12-16 02:48:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:39,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:48:39,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:48:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:48:39,081 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 137 [2021-12-16 02:48:39,087 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-16 02:48:39,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:39,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 137 [2021-12-16 02:48:39,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:39,202 INFO L129 PetriNetUnfolder]: 10/207 cut-off events. [2021-12-16 02:48:39,203 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-12-16 02:48:39,205 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-16 02:48:39,208 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 9 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2021-12-16 02:48:39,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 131 transitions, 296 flow [2021-12-16 02:48:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:48:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:48:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2021-12-16 02:48:39,226 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2021-12-16 02:48:39,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2021-12-16 02:48:39,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2021-12-16 02:48:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:39,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2021-12-16 02:48:39,242 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-16 02:48:39,249 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-16 02:48:39,249 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-16 02:48:39,251 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2021-12-16 02:48:39,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 131 transitions, 296 flow [2021-12-16 02:48:39,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 131 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 02:48:39,259 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2021-12-16 02:48:39,261 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-16 02:48:39,266 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2021-12-16 02:48:39,266 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2021-12-16 02:48:39,267 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-16 02:48:39,267 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:39,268 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-16 02:48:39,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:48:39,269 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-16 02:48:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1834671337, now seen corresponding path program 1 times [2021-12-16 02:48:39,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:39,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668077660] [2021-12-16 02:48:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:39,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:39,520 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-16 02:48:39,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:39,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668077660] [2021-12-16 02:48:39,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668077660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:39,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:39,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:48:39,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083156451] [2021-12-16 02:48:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:39,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:48:39,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:48:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:48:39,528 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-16 02:48:39,528 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-16 02:48:39,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:39,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-16 02:48:39,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:40,625 INFO L129 PetriNetUnfolder]: 2392/6497 cut-off events. [2021-12-16 02:48:40,626 INFO L130 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2021-12-16 02:48:40,648 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-16 02:48:40,665 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 30 selfloop transitions, 9 changer transitions 72/202 dead transitions. [2021-12-16 02:48:40,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 202 transitions, 630 flow [2021-12-16 02:48:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:48:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-16 02:48:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1072 transitions. [2021-12-16 02:48:40,669 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8694241686942417 [2021-12-16 02:48:40,669 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1072 transitions. [2021-12-16 02:48:40,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1072 transitions. [2021-12-16 02:48:40,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:40,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1072 transitions. [2021-12-16 02:48:40,672 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-16 02:48:40,675 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-16 02:48:40,675 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-16 02:48:40,676 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1072 transitions. [2021-12-16 02:48:40,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 202 transitions, 630 flow [2021-12-16 02:48:40,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 202 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 02:48:40,681 INFO L242 Difference]: Finished difference. Result has 154 places, 121 transitions, 348 flow [2021-12-16 02:48:40,681 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-16 02:48:40,681 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 10 predicate places. [2021-12-16 02:48:40,682 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 121 transitions, 348 flow [2021-12-16 02:48:40,682 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-16 02:48:40,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:40,719 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-16 02:48:40,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:48:40,720 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-16 02:48:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1975952054, now seen corresponding path program 1 times [2021-12-16 02:48:40,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:40,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185357956] [2021-12-16 02:48:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:40,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:40,888 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-16 02:48:40,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:40,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185357956] [2021-12-16 02:48:40,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185357956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:40,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:40,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:40,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110885108] [2021-12-16 02:48:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:40,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:40,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:40,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:40,891 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-16 02:48:40,892 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-16 02:48:40,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:40,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-16 02:48:40,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:41,664 INFO L129 PetriNetUnfolder]: 1501/3378 cut-off events. [2021-12-16 02:48:41,664 INFO L130 PetriNetUnfolder]: For 5465/5467 co-relation queries the response was YES. [2021-12-16 02:48:41,678 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-16 02:48:41,694 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 36 selfloop transitions, 8 changer transitions 73/208 dead transitions. [2021-12-16 02:48:41,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 208 transitions, 1146 flow [2021-12-16 02:48:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:48:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:48:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1507 transitions. [2021-12-16 02:48:41,699 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2021-12-16 02:48:41,699 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1507 transitions. [2021-12-16 02:48:41,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1507 transitions. [2021-12-16 02:48:41,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:41,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1507 transitions. [2021-12-16 02:48:41,704 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-16 02:48:41,707 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-16 02:48:41,709 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-16 02:48:41,709 INFO L186 Difference]: Start difference. First operand has 154 places, 121 transitions, 348 flow. Second operand 13 states and 1507 transitions. [2021-12-16 02:48:41,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 208 transitions, 1146 flow [2021-12-16 02:48:41,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 208 transitions, 1036 flow, removed 12 selfloop flow, removed 2 redundant places. [2021-12-16 02:48:41,734 INFO L242 Difference]: Finished difference. Result has 156 places, 125 transitions, 424 flow [2021-12-16 02:48:41,735 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-16 02:48:41,737 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 12 predicate places. [2021-12-16 02:48:41,737 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 125 transitions, 424 flow [2021-12-16 02:48:41,738 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-16 02:48:41,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:41,738 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-16 02:48:41,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:48:41,739 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-16 02:48:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1059977300, now seen corresponding path program 1 times [2021-12-16 02:48:41,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832918785] [2021-12-16 02:48:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:41,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:41,928 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-16 02:48:41,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:41,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832918785] [2021-12-16 02:48:41,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832918785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:41,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:41,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:41,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701940993] [2021-12-16 02:48:41,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:41,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:41,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:41,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:41,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-16 02:48:41,936 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-16 02:48:41,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:41,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-16 02:48:41,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:42,607 INFO L129 PetriNetUnfolder]: 1171/2637 cut-off events. [2021-12-16 02:48:42,608 INFO L130 PetriNetUnfolder]: For 7816/7826 co-relation queries the response was YES. [2021-12-16 02:48:42,617 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-16 02:48:42,628 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 40 selfloop transitions, 18 changer transitions 58/207 dead transitions. [2021-12-16 02:48:42,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 207 transitions, 1260 flow [2021-12-16 02:48:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:48:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:48:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1514 transitions. [2021-12-16 02:48:42,632 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8500842223469961 [2021-12-16 02:48:42,632 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1514 transitions. [2021-12-16 02:48:42,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1514 transitions. [2021-12-16 02:48:42,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:42,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1514 transitions. [2021-12-16 02:48:42,635 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-16 02:48:42,637 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-16 02:48:42,637 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-16 02:48:42,637 INFO L186 Difference]: Start difference. First operand has 156 places, 125 transitions, 424 flow. Second operand 13 states and 1514 transitions. [2021-12-16 02:48:42,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 207 transitions, 1260 flow [2021-12-16 02:48:42,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 207 transitions, 1177 flow, removed 39 selfloop flow, removed 7 redundant places. [2021-12-16 02:48:42,657 INFO L242 Difference]: Finished difference. Result has 163 places, 131 transitions, 547 flow [2021-12-16 02:48:42,657 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-16 02:48:42,658 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 19 predicate places. [2021-12-16 02:48:42,658 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 131 transitions, 547 flow [2021-12-16 02:48:42,658 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-16 02:48:42,658 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:42,659 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-16 02:48:42,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:48:42,659 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-16 02:48:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -17829693, now seen corresponding path program 1 times [2021-12-16 02:48:42,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:42,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72045242] [2021-12-16 02:48:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:42,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:42,737 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-16 02:48:42,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:42,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72045242] [2021-12-16 02:48:42,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72045242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:42,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:42,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:48:42,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31189231] [2021-12-16 02:48:42,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:42,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:48:42,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:48:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:48:42,740 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-16 02:48:42,740 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-16 02:48:42,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:42,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-16 02:48:42,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:44,620 INFO L129 PetriNetUnfolder]: 6523/12056 cut-off events. [2021-12-16 02:48:44,620 INFO L130 PetriNetUnfolder]: For 22662/26476 co-relation queries the response was YES. [2021-12-16 02:48:44,690 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-16 02:48:44,734 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 72 selfloop transitions, 20 changer transitions 8/208 dead transitions. [2021-12-16 02:48:44,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 208 transitions, 1141 flow [2021-12-16 02:48:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:48:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:48:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1213 transitions. [2021-12-16 02:48:44,737 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8854014598540146 [2021-12-16 02:48:44,737 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1213 transitions. [2021-12-16 02:48:44,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1213 transitions. [2021-12-16 02:48:44,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:44,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1213 transitions. [2021-12-16 02:48:44,740 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-16 02:48:44,741 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-16 02:48:44,742 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-16 02:48:44,742 INFO L186 Difference]: Start difference. First operand has 163 places, 131 transitions, 547 flow. Second operand 10 states and 1213 transitions. [2021-12-16 02:48:44,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 208 transitions, 1141 flow [2021-12-16 02:48:44,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 208 transitions, 1021 flow, removed 60 selfloop flow, removed 15 redundant places. [2021-12-16 02:48:44,805 INFO L242 Difference]: Finished difference. Result has 154 places, 149 transitions, 624 flow [2021-12-16 02:48:44,806 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-16 02:48:44,806 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 10 predicate places. [2021-12-16 02:48:44,806 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 149 transitions, 624 flow [2021-12-16 02:48:44,807 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-16 02:48:44,807 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:44,808 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-16 02:48:44,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:48:44,808 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-16 02:48:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash -985396970, now seen corresponding path program 1 times [2021-12-16 02:48:44,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:44,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108051439] [2021-12-16 02:48:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:44,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:44,898 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-16 02:48:44,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108051439] [2021-12-16 02:48:44,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108051439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:44,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:44,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:44,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779758277] [2021-12-16 02:48:44,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:44,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:44,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:44,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:44,901 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2021-12-16 02:48:44,902 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-16 02:48:44,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:44,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2021-12-16 02:48:44,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:45,856 INFO L129 PetriNetUnfolder]: 2262/6830 cut-off events. [2021-12-16 02:48:45,857 INFO L130 PetriNetUnfolder]: For 11544/13130 co-relation queries the response was YES. [2021-12-16 02:48:45,890 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-16 02:48:45,919 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 69 selfloop transitions, 22 changer transitions 0/200 dead transitions. [2021-12-16 02:48:45,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 200 transitions, 1147 flow [2021-12-16 02:48:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:48:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:48:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1162 transitions. [2021-12-16 02:48:45,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8481751824817518 [2021-12-16 02:48:45,922 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1162 transitions. [2021-12-16 02:48:45,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1162 transitions. [2021-12-16 02:48:45,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:45,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1162 transitions. [2021-12-16 02:48:45,925 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-16 02:48:45,927 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-16 02:48:45,928 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-16 02:48:45,928 INFO L186 Difference]: Start difference. First operand has 154 places, 149 transitions, 624 flow. Second operand 10 states and 1162 transitions. [2021-12-16 02:48:45,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 200 transitions, 1147 flow [2021-12-16 02:48:45,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 1145 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-16 02:48:45,958 INFO L242 Difference]: Finished difference. Result has 169 places, 157 transitions, 764 flow [2021-12-16 02:48:45,959 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-16 02:48:45,959 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 25 predicate places. [2021-12-16 02:48:45,959 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 157 transitions, 764 flow [2021-12-16 02:48:45,960 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-16 02:48:45,960 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:45,960 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-16 02:48:45,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:48:45,960 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-16 02:48:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash 617771064, now seen corresponding path program 1 times [2021-12-16 02:48:45,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:45,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075669569] [2021-12-16 02:48:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:45,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:46,064 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-16 02:48:46,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:46,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075669569] [2021-12-16 02:48:46,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075669569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:46,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:46,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:46,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712110510] [2021-12-16 02:48:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:46,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:46,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:46,070 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-16 02:48:46,071 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-16 02:48:46,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:46,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-16 02:48:46,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:48,589 INFO L129 PetriNetUnfolder]: 8490/16183 cut-off events. [2021-12-16 02:48:48,590 INFO L130 PetriNetUnfolder]: For 44463/48950 co-relation queries the response was YES. [2021-12-16 02:48:48,798 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-16 02:48:48,891 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 78 selfloop transitions, 30 changer transitions 32/256 dead transitions. [2021-12-16 02:48:48,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 256 transitions, 1704 flow [2021-12-16 02:48:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:48:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:48:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1580 transitions. [2021-12-16 02:48:48,900 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8871420550252667 [2021-12-16 02:48:48,900 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1580 transitions. [2021-12-16 02:48:48,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1580 transitions. [2021-12-16 02:48:48,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:48,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1580 transitions. [2021-12-16 02:48:48,907 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-16 02:48:48,912 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-16 02:48:48,913 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-16 02:48:48,913 INFO L186 Difference]: Start difference. First operand has 169 places, 157 transitions, 764 flow. Second operand 13 states and 1580 transitions. [2021-12-16 02:48:48,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 256 transitions, 1704 flow [2021-12-16 02:48:49,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 256 transitions, 1644 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-12-16 02:48:49,060 INFO L242 Difference]: Finished difference. Result has 186 places, 169 transitions, 956 flow [2021-12-16 02:48:49,060 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-16 02:48:49,061 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 42 predicate places. [2021-12-16 02:48:49,061 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 169 transitions, 956 flow [2021-12-16 02:48:49,062 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-16 02:48:49,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:49,062 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-16 02:48:49,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:48:49,063 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-16 02:48:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -797246224, now seen corresponding path program 1 times [2021-12-16 02:48:49,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:49,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21883926] [2021-12-16 02:48:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:49,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:49,180 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-16 02:48:49,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:49,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21883926] [2021-12-16 02:48:49,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21883926] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:49,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:49,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:48:49,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611425516] [2021-12-16 02:48:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:49,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:48:49,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:48:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:48:49,183 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-16 02:48:49,184 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-16 02:48:49,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:49,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-16 02:48:49,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:50,739 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-16 02:48:50,740 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-16 02:48:50,740 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:48:50,742 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:48:50,742 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:48:50,901 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-16 02:48:50,902 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,902 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,902 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,902 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,903 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-16 02:48:50,903 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,903 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,904 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:48:50,904 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:48:51,055 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-16 02:48:51,056 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,056 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,056 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,057 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,057 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-16 02:48:51,058 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,058 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,058 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,058 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:48:51,191 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-16 02:48:51,207 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,207 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,208 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,208 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,208 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-16 02:48:51,209 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,209 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,209 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,209 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-16 02:48:51,312 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-16 02:48:51,313 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-16 02:48:51,313 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:48:51,313 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:48:51,313 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:48:51,467 INFO L129 PetriNetUnfolder]: 7332/15466 cut-off events. [2021-12-16 02:48:51,468 INFO L130 PetriNetUnfolder]: For 71341/76650 co-relation queries the response was YES. [2021-12-16 02:48:51,648 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-16 02:48:51,693 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 89 selfloop transitions, 48 changer transitions 38/283 dead transitions. [2021-12-16 02:48:51,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 283 transitions, 2194 flow [2021-12-16 02:48:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 02:48:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 02:48:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1940 transitions. [2021-12-16 02:48:51,697 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.885036496350365 [2021-12-16 02:48:51,697 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1940 transitions. [2021-12-16 02:48:51,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1940 transitions. [2021-12-16 02:48:51,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:51,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1940 transitions. [2021-12-16 02:48:51,701 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-16 02:48:51,704 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-16 02:48:51,705 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-16 02:48:51,705 INFO L186 Difference]: Start difference. First operand has 186 places, 169 transitions, 956 flow. Second operand 16 states and 1940 transitions. [2021-12-16 02:48:51,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 283 transitions, 2194 flow [2021-12-16 02:48:53,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 283 transitions, 2089 flow, removed 43 selfloop flow, removed 5 redundant places. [2021-12-16 02:48:53,102 INFO L242 Difference]: Finished difference. Result has 200 places, 185 transitions, 1197 flow [2021-12-16 02:48:53,102 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-16 02:48:53,103 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 56 predicate places. [2021-12-16 02:48:53,103 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 185 transitions, 1197 flow [2021-12-16 02:48:53,103 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-16 02:48:53,104 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:53,104 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-16 02:48:53,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:48:53,104 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-16 02:48:53,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1214511428, now seen corresponding path program 1 times [2021-12-16 02:48:53,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:53,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345803687] [2021-12-16 02:48:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:53,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:53,182 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-16 02:48:53,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345803687] [2021-12-16 02:48:53,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345803687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:53,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:53,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:53,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148260223] [2021-12-16 02:48:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:53,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:53,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:53,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:53,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:53,184 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2021-12-16 02:48:53,185 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-16 02:48:53,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:53,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2021-12-16 02:48:53,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:54,319 INFO L129 PetriNetUnfolder]: 2640/9834 cut-off events. [2021-12-16 02:48:54,320 INFO L130 PetriNetUnfolder]: For 45819/47920 co-relation queries the response was YES. [2021-12-16 02:48:54,413 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-16 02:48:54,458 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 53 selfloop transitions, 25 changer transitions 21/242 dead transitions. [2021-12-16 02:48:54,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 242 transitions, 1798 flow [2021-12-16 02:48:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:48:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 02:48:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1251 transitions. [2021-12-16 02:48:54,476 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8301260783012607 [2021-12-16 02:48:54,476 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1251 transitions. [2021-12-16 02:48:54,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1251 transitions. [2021-12-16 02:48:54,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:54,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1251 transitions. [2021-12-16 02:48:54,480 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-16 02:48:54,484 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-16 02:48:54,484 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-16 02:48:54,484 INFO L186 Difference]: Start difference. First operand has 200 places, 185 transitions, 1197 flow. Second operand 11 states and 1251 transitions. [2021-12-16 02:48:54,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 242 transitions, 1798 flow [2021-12-16 02:48:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 242 transitions, 1451 flow, removed 140 selfloop flow, removed 17 redundant places. [2021-12-16 02:48:56,133 INFO L242 Difference]: Finished difference. Result has 195 places, 194 transitions, 1104 flow [2021-12-16 02:48:56,134 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-16 02:48:56,135 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 51 predicate places. [2021-12-16 02:48:56,140 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 194 transitions, 1104 flow [2021-12-16 02:48:56,140 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-16 02:48:56,141 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:56,141 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-16 02:48:56,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:48:56,141 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-16 02:48:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash -809938198, now seen corresponding path program 2 times [2021-12-16 02:48:56,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10456147] [2021-12-16 02:48:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:56,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:56,283 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-16 02:48:56,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:56,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10456147] [2021-12-16 02:48:56,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10456147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:56,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:56,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:48:56,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519986884] [2021-12-16 02:48:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:56,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:48:56,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:48:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:48:56,285 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-16 02:48:56,286 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-16 02:48:56,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:56,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-16 02:48:56,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:48:57,436 INFO L129 PetriNetUnfolder]: 3280/11556 cut-off events. [2021-12-16 02:48:57,437 INFO L130 PetriNetUnfolder]: For 16884/17301 co-relation queries the response was YES. [2021-12-16 02:48:57,542 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-16 02:48:57,571 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 42 selfloop transitions, 4 changer transitions 11/224 dead transitions. [2021-12-16 02:48:57,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 224 transitions, 1438 flow [2021-12-16 02:48:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:48:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:48:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2021-12-16 02:48:57,574 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2021-12-16 02:48:57,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2021-12-16 02:48:57,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2021-12-16 02:48:57,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:48:57,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2021-12-16 02:48:57,576 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-16 02:48:57,577 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-16 02:48:57,578 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-16 02:48:57,578 INFO L186 Difference]: Start difference. First operand has 195 places, 194 transitions, 1104 flow. Second operand 7 states and 847 transitions. [2021-12-16 02:48:57,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 224 transitions, 1438 flow [2021-12-16 02:48:58,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 224 transitions, 1352 flow, removed 43 selfloop flow, removed 6 redundant places. [2021-12-16 02:48:58,283 INFO L242 Difference]: Finished difference. Result has 193 places, 193 transitions, 1083 flow [2021-12-16 02:48:58,283 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-16 02:48:58,284 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 49 predicate places. [2021-12-16 02:48:58,284 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 193 transitions, 1083 flow [2021-12-16 02:48:58,284 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-16 02:48:58,284 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:48:58,285 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-16 02:48:58,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:48:58,285 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-16 02:48:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:48:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash -760236008, now seen corresponding path program 3 times [2021-12-16 02:48:58,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:48:58,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400322605] [2021-12-16 02:48:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:48:58,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:48:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:48:58,363 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-16 02:48:58,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:48:58,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400322605] [2021-12-16 02:48:58,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400322605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:48:58,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:48:58,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 02:48:58,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983527549] [2021-12-16 02:48:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:48:58,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 02:48:58,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:48:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 02:48:58,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:48:58,366 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2021-12-16 02:48:58,366 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-16 02:48:58,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:48:58,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2021-12-16 02:48:58,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:01,788 INFO L129 PetriNetUnfolder]: 11925/26098 cut-off events. [2021-12-16 02:49:01,788 INFO L130 PetriNetUnfolder]: For 72621/83028 co-relation queries the response was YES. [2021-12-16 02:49:02,084 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-16 02:49:02,112 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 49 selfloop transitions, 43 changer transitions 105/295 dead transitions. [2021-12-16 02:49:02,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 295 transitions, 2266 flow [2021-12-16 02:49:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 02:49:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-16 02:49:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2270 transitions. [2021-12-16 02:49:02,135 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8720706876680753 [2021-12-16 02:49:02,135 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2270 transitions. [2021-12-16 02:49:02,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2270 transitions. [2021-12-16 02:49:02,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:02,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2270 transitions. [2021-12-16 02:49:02,139 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-16 02:49:02,142 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-16 02:49:02,143 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-16 02:49:02,143 INFO L186 Difference]: Start difference. First operand has 193 places, 193 transitions, 1083 flow. Second operand 19 states and 2270 transitions. [2021-12-16 02:49:02,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 295 transitions, 2266 flow [2021-12-16 02:49:04,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 295 transitions, 2155 flow, removed 52 selfloop flow, removed 5 redundant places. [2021-12-16 02:49:04,912 INFO L242 Difference]: Finished difference. Result has 210 places, 162 transitions, 874 flow [2021-12-16 02:49:04,913 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-16 02:49:04,913 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 66 predicate places. [2021-12-16 02:49:04,913 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 162 transitions, 874 flow [2021-12-16 02:49:04,914 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-16 02:49:04,914 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:04,914 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-16 02:49:04,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 02:49:04,915 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-16 02:49:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1999778396, now seen corresponding path program 1 times [2021-12-16 02:49:04,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:04,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927429550] [2021-12-16 02:49:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:04,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:05,009 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-16 02:49:05,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927429550] [2021-12-16 02:49:05,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927429550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:05,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:05,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:49:05,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212292750] [2021-12-16 02:49:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:05,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:49:05,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:49:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:49:05,012 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2021-12-16 02:49:05,013 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-16 02:49:05,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:05,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2021-12-16 02:49:05,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:05,371 INFO L129 PetriNetUnfolder]: 654/2880 cut-off events. [2021-12-16 02:49:05,371 INFO L130 PetriNetUnfolder]: For 6203/6425 co-relation queries the response was YES. [2021-12-16 02:49:05,389 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-16 02:49:05,394 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 26 selfloop transitions, 14 changer transitions 13/184 dead transitions. [2021-12-16 02:49:05,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 184 transitions, 1137 flow [2021-12-16 02:49:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 02:49:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-16 02:49:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2021-12-16 02:49:05,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8193430656934306 [2021-12-16 02:49:05,396 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2021-12-16 02:49:05,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2021-12-16 02:49:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:05,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2021-12-16 02:49:05,397 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-16 02:49:05,398 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-16 02:49:05,398 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-16 02:49:05,399 INFO L186 Difference]: Start difference. First operand has 210 places, 162 transitions, 874 flow. Second operand 8 states and 898 transitions. [2021-12-16 02:49:05,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 184 transitions, 1137 flow [2021-12-16 02:49:05,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 184 transitions, 881 flow, removed 60 selfloop flow, removed 29 redundant places. [2021-12-16 02:49:05,457 INFO L242 Difference]: Finished difference. Result has 183 places, 165 transitions, 764 flow [2021-12-16 02:49:05,457 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-16 02:49:05,459 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 39 predicate places. [2021-12-16 02:49:05,459 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 165 transitions, 764 flow [2021-12-16 02:49:05,459 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-16 02:49:05,459 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:05,459 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-16 02:49:05,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 02:49:05,460 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-16 02:49:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 368710094, now seen corresponding path program 2 times [2021-12-16 02:49:05,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:05,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42238938] [2021-12-16 02:49:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:05,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:05,544 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-16 02:49:05,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:05,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42238938] [2021-12-16 02:49:05,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42238938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:05,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:05,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:49:05,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232356671] [2021-12-16 02:49:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:05,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:49:05,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:05,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:49:05,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:49:05,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-16 02:49:05,547 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-16 02:49:05,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:05,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-16 02:49:05,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:05,937 INFO L129 PetriNetUnfolder]: 655/2537 cut-off events. [2021-12-16 02:49:05,947 INFO L130 PetriNetUnfolder]: For 3669/3758 co-relation queries the response was YES. [2021-12-16 02:49:05,960 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-16 02:49:05,966 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 23 selfloop transitions, 3 changer transitions 5/174 dead transitions. [2021-12-16 02:49:05,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 174 transitions, 852 flow [2021-12-16 02:49:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:49:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:49:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2021-12-16 02:49:05,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8633993743482794 [2021-12-16 02:49:05,968 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2021-12-16 02:49:05,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2021-12-16 02:49:05,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:05,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2021-12-16 02:49:05,970 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-16 02:49:05,971 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-16 02:49:05,972 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-16 02:49:05,972 INFO L186 Difference]: Start difference. First operand has 183 places, 165 transitions, 764 flow. Second operand 7 states and 828 transitions. [2021-12-16 02:49:05,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 174 transitions, 852 flow [2021-12-16 02:49:06,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 815 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-12-16 02:49:06,029 INFO L242 Difference]: Finished difference. Result has 183 places, 165 transitions, 746 flow [2021-12-16 02:49:06,029 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-16 02:49:06,030 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 39 predicate places. [2021-12-16 02:49:06,030 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 165 transitions, 746 flow [2021-12-16 02:49:06,031 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-16 02:49:06,031 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:06,031 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-16 02:49:06,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 02:49:06,031 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-16 02:49:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash 915569688, now seen corresponding path program 3 times [2021-12-16 02:49:06,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:06,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723623500] [2021-12-16 02:49:06,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:06,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:49:06,189 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-16 02:49:06,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:49:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723623500] [2021-12-16 02:49:06,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723623500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:49:06,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:49:06,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 02:49:06,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128123065] [2021-12-16 02:49:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:49:06,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 02:49:06,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:49:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 02:49:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:49:06,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2021-12-16 02:49:06,194 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-16 02:49:06,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:49:06,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2021-12-16 02:49:06,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:49:06,622 INFO L129 PetriNetUnfolder]: 961/3507 cut-off events. [2021-12-16 02:49:06,622 INFO L130 PetriNetUnfolder]: For 5175/5240 co-relation queries the response was YES. [2021-12-16 02:49:06,640 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-16 02:49:06,643 INFO L132 encePairwiseOnDemand]: 128/137 looper letters, 17 selfloop transitions, 5 changer transitions 46/173 dead transitions. [2021-12-16 02:49:06,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 173 transitions, 849 flow [2021-12-16 02:49:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:49:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:49:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1138 transitions. [2021-12-16 02:49:06,646 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8306569343065694 [2021-12-16 02:49:06,646 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1138 transitions. [2021-12-16 02:49:06,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1138 transitions. [2021-12-16 02:49:06,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:49:06,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1138 transitions. [2021-12-16 02:49:06,648 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-16 02:49:06,649 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-16 02:49:06,649 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-16 02:49:06,649 INFO L186 Difference]: Start difference. First operand has 183 places, 165 transitions, 746 flow. Second operand 10 states and 1138 transitions. [2021-12-16 02:49:06,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 173 transitions, 849 flow [2021-12-16 02:49:06,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 173 transitions, 837 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-16 02:49:06,763 INFO L242 Difference]: Finished difference. Result has 190 places, 127 transitions, 455 flow [2021-12-16 02:49:06,764 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-16 02:49:06,764 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 46 predicate places. [2021-12-16 02:49:06,764 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 127 transitions, 455 flow [2021-12-16 02:49:06,765 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-16 02:49:06,765 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:49:06,765 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-16 02:49:06,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 02:49:06,766 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-16 02:49:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:49:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1348120654, now seen corresponding path program 4 times [2021-12-16 02:49:06,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:49:06,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965938380] [2021-12-16 02:49:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:49:06,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:49:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:49:06,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 02:49:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:49:06,884 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 02:49:06,884 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 02:49:06,885 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-16 02:49:06,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-16 02:49:06,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-16 02:49:06,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-16 02:49:06,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-16 02:49:06,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-16 02:49:06,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-16 02:49:06,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 02:49:06,892 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:49:06,896 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-16 02:49:06,896 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:49:07,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:49:07 BasicIcfg [2021-12-16 02:49:07,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:49:07,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:49:07,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:49:07,051 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:49:07,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:48:38" (3/4) ... [2021-12-16 02:49:07,053 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 02:49:07,176 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:49:07,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:49:07,177 INFO L158 Benchmark]: Toolchain (without parser) took 30288.58ms. Allocated memory was 127.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 89.5MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 614.1MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,177 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory was 101.2MB in the beginning and 101.2MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:49:07,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.12ms. Allocated memory is still 127.9MB. Free memory was 89.5MB in the beginning and 87.7MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.22ms. Allocated memory is still 127.9MB. Free memory was 87.7MB in the beginning and 85.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,178 INFO L158 Benchmark]: Boogie Preprocessor took 50.01ms. Allocated memory is still 127.9MB. Free memory was 85.0MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,178 INFO L158 Benchmark]: RCFGBuilder took 963.50ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 82.9MB in the beginning and 107.6MB in the end (delta: -24.7MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,178 INFO L158 Benchmark]: TraceAbstraction took 28571.93ms. Allocated memory was 163.6MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 107.6MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 548.9MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,178 INFO L158 Benchmark]: Witness Printer took 125.96ms. Allocated memory is still 4.5GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2021-12-16 02:49:07,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory was 101.2MB in the beginning and 101.2MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.12ms. Allocated memory is still 127.9MB. Free memory was 89.5MB in the beginning and 87.7MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.22ms. Allocated memory is still 127.9MB. Free memory was 87.7MB in the beginning and 85.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.01ms. Allocated memory is still 127.9MB. Free memory was 85.0MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 963.50ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 82.9MB in the beginning and 107.6MB in the end (delta: -24.7MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28571.93ms. Allocated memory was 163.6MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 107.6MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 548.9MB. Max. memory is 16.1GB. * Witness Printer took 125.96ms. Allocated memory is still 4.5GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. 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)=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] - 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: 28.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 1.4s 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.2s 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.4s SatisfiabilityAnalysisTime, 1.3s 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-16 02:49:07,227 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