./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix043.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/mix043.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:48:55,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:48:55,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:48:55,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:48:55,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:48:55,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:48:55,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:48:55,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:48:55,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:48:55,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:48:55,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:48:55,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:48:55,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:48:55,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:48:55,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:48:55,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:48:55,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:48:55,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:48:55,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:48:55,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:48:55,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:48:55,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:48:55,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:48:55,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:48:55,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:48:55,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:48:55,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:48:55,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:48:55,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:48:55,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:48:55,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:48:55,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:48:55,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:48:55,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:48:55,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:48:55,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:48:55,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:48:55,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:48:55,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:48:55,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:48:55,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:48:55,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:48:55,754 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:48:55,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:48:55,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:48:55,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:48:55,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:48:55,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:48:55,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:48:55,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:48:55,757 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:48:55,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:48:55,758 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:48:55,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:48:55,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:48:55,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:48:55,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:48:55,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:48:55,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:48:55,759 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:48:55,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:48:55,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:48:55,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:48:55,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:48:55,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:48:55,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:48:55,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:48:55,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:48:55,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:48:55,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:48:55,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:48:55,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:48:55,761 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:48:55,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:48:55,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:48:55,762 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2021-12-28 02:48:56,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:48:56,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:48:56,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:48:56,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:48:56,062 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:48:56,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2021-12-28 02:48:56,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0355e38d8/d6f9fd2efb8845eeb42518115ef0c1d2/FLAG4ddd77cee [2021-12-28 02:48:56,525 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:48:56,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2021-12-28 02:48:56,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0355e38d8/d6f9fd2efb8845eeb42518115ef0c1d2/FLAG4ddd77cee [2021-12-28 02:48:56,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0355e38d8/d6f9fd2efb8845eeb42518115ef0c1d2 [2021-12-28 02:48:56,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:48:56,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:48:56,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:48:56,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:48:56,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:48:56,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:48:56" (1/1) ... [2021-12-28 02:48:56,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8c7964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:56, skipping insertion in model container [2021-12-28 02:48:56,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:48:56" (1/1) ... [2021-12-28 02:48:56,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:48:56,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:48:56,787 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/mix043.oepc.i[945,958] [2021-12-28 02:48:56,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:48:56,962 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:48:56,971 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/mix043.oepc.i[945,958] [2021-12-28 02:48:57,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:48:57,035 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:48:57,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57 WrapperNode [2021-12-28 02:48:57,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:48:57,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:48:57,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:48:57,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:48:57,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,094 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2021-12-28 02:48:57,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:48:57,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:48:57,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:48:57,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:48:57,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:48:57,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:48:57,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:48:57,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:48:57,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (1/1) ... [2021-12-28 02:48:57,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:48:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:48:57,171 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-28 02:48:57,192 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-28 02:48:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 02:48:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 02:48:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:48:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 02:48:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 02:48:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-28 02:48:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-28 02:48:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-28 02:48:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-28 02:48:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-28 02:48:57,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-28 02:48:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-28 02:48:57,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-28 02:48:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:48:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 02:48:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:48:57,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:48:57,235 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 02:48:57,330 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:48:57,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:48:57,747 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:48:57,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:48:57,969 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 02:48:57,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:48:57 BoogieIcfgContainer [2021-12-28 02:48:57,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:48:57,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:48:57,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:48:57,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:48:57,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:48:56" (1/3) ... [2021-12-28 02:48:57,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e0ee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:48:57, skipping insertion in model container [2021-12-28 02:48:57,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:57" (2/3) ... [2021-12-28 02:48:57,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e0ee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:48:57, skipping insertion in model container [2021-12-28 02:48:57,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:48:57" (3/3) ... [2021-12-28 02:48:57,978 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2021-12-28 02:48:57,981 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 02:48:57,981 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:48:57,981 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:48:57,981 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 02:48:58,041 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,042 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,042 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,042 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,043 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,043 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,043 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,043 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,044 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,044 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,044 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,044 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,044 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,044 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,045 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,045 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,045 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,046 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,046 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,046 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,046 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,047 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,047 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,047 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,048 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,048 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,048 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,048 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,048 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,048 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,050 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,053 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,053 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,053 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,053 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,053 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,054 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,054 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,055 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,055 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,056 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,056 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,060 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,060 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,060 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,061 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,062 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,062 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,062 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,063 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,063 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,067 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,068 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,068 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,068 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,068 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,068 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,068 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,069 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,074 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,075 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,076 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,077 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,077 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,077 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,077 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,077 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,078 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,079 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,080 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,080 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,080 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,080 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,080 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,080 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,082 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,082 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,082 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,082 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,082 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,083 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,083 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,083 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,083 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,083 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,083 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,084 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,084 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,084 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,087 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,087 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,088 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,088 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,088 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,088 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,088 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,088 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,089 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,090 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,090 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,092 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,093 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,094 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,094 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,094 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,095 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,095 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,095 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,096 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,096 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,096 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,096 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,096 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,096 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,101 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,101 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,101 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,101 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,102 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,102 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,103 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,105 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,105 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:58,105 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-28 02:48:58,144 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:48:58,150 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-28 02:48:58,150 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-28 02:48:58,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2021-12-28 02:48:58,206 INFO L129 PetriNetUnfolder]: 2/136 cut-off events. [2021-12-28 02:48:58,206 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:48:58,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2021-12-28 02:48:58,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2021-12-28 02:48:58,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2021-12-28 02:48:58,229 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-12-28 02:48:58,230 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:48:58,230 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:58,231 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] [2021-12-28 02:48:58,231 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1071099749, now seen corresponding path program 1 times [2021-12-28 02:48:58,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:58,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247759048] [2021-12-28 02:48:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:58,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:58,455 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-28 02:48:58,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:58,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247759048] [2021-12-28 02:48:58,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247759048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:58,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:58,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 02:48:58,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284514454] [2021-12-28 02:48:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:58,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 02:48:58,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:58,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 02:48:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 02:48:58,489 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2021-12-28 02:48:58,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-28 02:48:58,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:58,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2021-12-28 02:48:58,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:58,726 INFO L129 PetriNetUnfolder]: 162/624 cut-off events. [2021-12-28 02:48:58,726 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-12-28 02:48:58,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 624 events. 162/624 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3446 event pairs, 132 based on Foata normal form. 46/628 useless extension candidates. Maximal degree in co-relation 871. Up to 191 conditions per place. [2021-12-28 02:48:58,736 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 18 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2021-12-28 02:48:58,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 341 flow [2021-12-28 02:48:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 02:48:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 02:48:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2021-12-28 02:48:58,753 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452380952380952 [2021-12-28 02:48:58,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2021-12-28 02:48:58,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2021-12-28 02:48:58,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:58,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2021-12-28 02:48:58,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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-28 02:48:58,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:48:58,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:48:58,770 INFO L186 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 397 transitions. [2021-12-28 02:48:58,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 341 flow [2021-12-28 02:48:58,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-28 02:48:58,776 INFO L242 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2021-12-28 02:48:58,778 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2021-12-28 02:48:58,780 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2021-12-28 02:48:58,781 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2021-12-28 02:48:58,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-28 02:48:58,781 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:58,781 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-28 02:48:58,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:48:58,782 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2044475513, now seen corresponding path program 1 times [2021-12-28 02:48:58,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:58,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722327893] [2021-12-28 02:48:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:58,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:59,027 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-28 02:48:59,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:59,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722327893] [2021-12-28 02:48:59,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722327893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:59,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:59,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:59,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776995615] [2021-12-28 02:48:59,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:59,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:59,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:59,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:59,033 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2021-12-28 02:48:59,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 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-28 02:48:59,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:59,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2021-12-28 02:48:59,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:01,635 INFO L129 PetriNetUnfolder]: 10217/22271 cut-off events. [2021-12-28 02:49:01,635 INFO L130 PetriNetUnfolder]: For 948/948 co-relation queries the response was YES. [2021-12-28 02:49:01,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37476 conditions, 22271 events. 10217/22271 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 225329 event pairs, 2468 based on Foata normal form. 0/21856 useless extension candidates. Maximal degree in co-relation 37414. Up to 5947 conditions per place. [2021-12-28 02:49:01,773 INFO L132 encePairwiseOnDemand]: 127/140 looper letters, 37 selfloop transitions, 9 changer transitions 90/227 dead transitions. [2021-12-28 02:49:01,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 227 transitions, 732 flow [2021-12-28 02:49:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2021-12-28 02:49:01,777 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8706349206349207 [2021-12-28 02:49:01,777 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2021-12-28 02:49:01,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2021-12-28 02:49:01,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:01,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2021-12-28 02:49:01,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 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-28 02:49:01,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-28 02:49:01,782 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-28 02:49:01,783 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 9 states and 1097 transitions. [2021-12-28 02:49:01,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 227 transitions, 732 flow [2021-12-28 02:49:01,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 227 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 02:49:01,790 INFO L242 Difference]: Finished difference. Result has 157 places, 124 transitions, 354 flow [2021-12-28 02:49:01,790 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=157, PETRI_TRANSITIONS=124} [2021-12-28 02:49:01,791 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2021-12-28 02:49:01,792 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 124 transitions, 354 flow [2021-12-28 02:49:01,793 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-28 02:49:01,793 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:01,793 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-28 02:49:01,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:49:01,793 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash 22435504, now seen corresponding path program 1 times [2021-12-28 02:49:01,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:01,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850046261] [2021-12-28 02:49:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:01,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:01,942 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-28 02:49:01,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:01,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850046261] [2021-12-28 02:49:01,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850046261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:01,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:01,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:49:01,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842207671] [2021-12-28 02:49:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:01,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:49:01,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:01,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:49:01,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:49:01,945 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2021-12-28 02:49:01,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 124 transitions, 354 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-28 02:49:01,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:01,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2021-12-28 02:49:01,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:03,656 INFO L129 PetriNetUnfolder]: 6853/11635 cut-off events. [2021-12-28 02:49:03,656 INFO L130 PetriNetUnfolder]: For 17472/17472 co-relation queries the response was YES. [2021-12-28 02:49:03,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34036 conditions, 11635 events. 6853/11635 cut-off events. For 17472/17472 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 86461 event pairs, 902 based on Foata normal form. 290/11798 useless extension candidates. Maximal degree in co-relation 33962. Up to 3060 conditions per place. [2021-12-28 02:49:03,741 INFO L132 encePairwiseOnDemand]: 130/140 looper letters, 46 selfloop transitions, 7 changer transitions 100/244 dead transitions. [2021-12-28 02:49:03,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 1242 flow [2021-12-28 02:49:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1543 transitions. [2021-12-28 02:49:03,744 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8478021978021978 [2021-12-28 02:49:03,744 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1543 transitions. [2021-12-28 02:49:03,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1543 transitions. [2021-12-28 02:49:03,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:03,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1543 transitions. [2021-12-28 02:49:03,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.6923076923077) internal successors, (1543), 13 states have internal predecessors, (1543), 0 states have call successors, (0), 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-28 02:49:03,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 0 states have call successors, (0), 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-28 02:49:03,751 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 0 states have call successors, (0), 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-28 02:49:03,751 INFO L186 Difference]: Start difference. First operand has 157 places, 124 transitions, 354 flow. Second operand 13 states and 1543 transitions. [2021-12-28 02:49:03,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 1242 flow [2021-12-28 02:49:03,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 244 transitions, 1140 flow, removed 12 selfloop flow, removed 2 redundant places. [2021-12-28 02:49:03,813 INFO L242 Difference]: Finished difference. Result has 159 places, 127 transitions, 414 flow [2021-12-28 02:49:03,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=414, PETRI_PLACES=159, PETRI_TRANSITIONS=127} [2021-12-28 02:49:03,814 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 12 predicate places. [2021-12-28 02:49:03,815 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 127 transitions, 414 flow [2021-12-28 02:49:03,815 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-28 02:49:03,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:03,815 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-28 02:49:03,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:49:03,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1492367369, now seen corresponding path program 1 times [2021-12-28 02:49:03,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:03,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762472797] [2021-12-28 02:49:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:03,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:03,900 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-28 02:49:03,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:03,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762472797] [2021-12-28 02:49:03,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762472797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:03,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:03,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:03,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361623347] [2021-12-28 02:49:03,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:03,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:03,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:03,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:03,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:03,903 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-28 02:49:03,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 127 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 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-28 02:49:03,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:03,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-28 02:49:03,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:07,021 INFO L129 PetriNetUnfolder]: 15017/26270 cut-off events. [2021-12-28 02:49:07,021 INFO L130 PetriNetUnfolder]: For 22170/30371 co-relation queries the response was YES. [2021-12-28 02:49:07,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60006 conditions, 26270 events. 15017/26270 cut-off events. For 22170/30371 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 234344 event pairs, 937 based on Foata normal form. 118/24984 useless extension candidates. Maximal degree in co-relation 59926. Up to 8099 conditions per place. [2021-12-28 02:49:07,255 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 93 selfloop transitions, 20 changer transitions 0/216 dead transitions. [2021-12-28 02:49:07,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 216 transitions, 922 flow [2021-12-28 02:49:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:49:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:49:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1237 transitions. [2021-12-28 02:49:07,259 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8835714285714286 [2021-12-28 02:49:07,259 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1237 transitions. [2021-12-28 02:49:07,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1237 transitions. [2021-12-28 02:49:07,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:07,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1237 transitions. [2021-12-28 02:49:07,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 0 states have call successors, (0), 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-28 02:49:07,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 0 states have call successors, (0), 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-28 02:49:07,265 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 0 states have call successors, (0), 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-28 02:49:07,265 INFO L186 Difference]: Start difference. First operand has 159 places, 127 transitions, 414 flow. Second operand 10 states and 1237 transitions. [2021-12-28 02:49:07,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 216 transitions, 922 flow [2021-12-28 02:49:07,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 216 transitions, 895 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-12-28 02:49:07,300 INFO L242 Difference]: Finished difference. Result has 158 places, 145 transitions, 530 flow [2021-12-28 02:49:07,301 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=530, PETRI_PLACES=158, PETRI_TRANSITIONS=145} [2021-12-28 02:49:07,302 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2021-12-28 02:49:07,302 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 530 flow [2021-12-28 02:49:07,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 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-28 02:49:07,303 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:07,303 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] [2021-12-28 02:49:07,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:49:07,303 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 203552243, now seen corresponding path program 1 times [2021-12-28 02:49:07,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:07,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984377165] [2021-12-28 02:49:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:07,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:07,440 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-28 02:49:07,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:07,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984377165] [2021-12-28 02:49:07,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984377165] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:07,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:07,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:49:07,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088646046] [2021-12-28 02:49:07,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:07,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:49:07,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:49:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:49:07,443 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-28 02:49:07,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 145 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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-28 02:49:07,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:07,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-28 02:49:07,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:10,451 INFO L129 PetriNetUnfolder]: 13757/24856 cut-off events. [2021-12-28 02:49:10,451 INFO L130 PetriNetUnfolder]: For 39665/46693 co-relation queries the response was YES. [2021-12-28 02:49:10,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75083 conditions, 24856 events. 13757/24856 cut-off events. For 39665/46693 co-relation queries the response was YES. Maximal size of possible extension queue 1675. Compared 230198 event pairs, 780 based on Foata normal form. 464/24491 useless extension candidates. Maximal degree in co-relation 75001. Up to 5144 conditions per place. [2021-12-28 02:49:10,660 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 121 selfloop transitions, 38 changer transitions 0/262 dead transitions. [2021-12-28 02:49:10,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 262 transitions, 1428 flow [2021-12-28 02:49:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1613 transitions. [2021-12-28 02:49:10,663 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8862637362637362 [2021-12-28 02:49:10,663 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1613 transitions. [2021-12-28 02:49:10,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1613 transitions. [2021-12-28 02:49:10,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:10,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1613 transitions. [2021-12-28 02:49:10,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 124.07692307692308) internal successors, (1613), 13 states have internal predecessors, (1613), 0 states have call successors, (0), 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-28 02:49:10,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 0 states have call successors, (0), 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-28 02:49:10,669 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 0 states have call successors, (0), 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-28 02:49:10,669 INFO L186 Difference]: Start difference. First operand has 158 places, 145 transitions, 530 flow. Second operand 13 states and 1613 transitions. [2021-12-28 02:49:10,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 262 transitions, 1428 flow [2021-12-28 02:49:11,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 262 transitions, 1408 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-12-28 02:49:11,208 INFO L242 Difference]: Finished difference. Result has 169 places, 165 transitions, 803 flow [2021-12-28 02:49:11,209 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=803, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2021-12-28 02:49:11,209 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 22 predicate places. [2021-12-28 02:49:11,210 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 803 flow [2021-12-28 02:49:11,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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-28 02:49:11,210 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:11,210 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] [2021-12-28 02:49:11,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:49:11,211 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2105306102, now seen corresponding path program 1 times [2021-12-28 02:49:11,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:11,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463321672] [2021-12-28 02:49:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:11,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:11,340 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-28 02:49:11,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:11,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463321672] [2021-12-28 02:49:11,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463321672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:11,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:11,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:49:11,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217581689] [2021-12-28 02:49:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:11,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:49:11,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:11,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:49:11,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:49:11,343 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-28 02:49:11,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 803 flow. Second operand has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 0 states have call successors, (0), 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-28 02:49:11,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:11,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-28 02:49:11,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:14,559 INFO L129 PetriNetUnfolder]: 13282/24144 cut-off events. [2021-12-28 02:49:14,559 INFO L130 PetriNetUnfolder]: For 77085/84089 co-relation queries the response was YES. [2021-12-28 02:49:14,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88758 conditions, 24144 events. 13282/24144 cut-off events. For 77085/84089 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 225874 event pairs, 760 based on Foata normal form. 358/23674 useless extension candidates. Maximal degree in co-relation 88674. Up to 5006 conditions per place. [2021-12-28 02:49:14,842 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 119 selfloop transitions, 58 changer transitions 30/310 dead transitions. [2021-12-28 02:49:14,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 310 transitions, 2111 flow [2021-12-28 02:49:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:49:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:49:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1988 transitions. [2021-12-28 02:49:14,852 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8875 [2021-12-28 02:49:14,852 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1988 transitions. [2021-12-28 02:49:14,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1988 transitions. [2021-12-28 02:49:14,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:14,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1988 transitions. [2021-12-28 02:49:14,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 124.25) internal successors, (1988), 16 states have internal predecessors, (1988), 0 states have call successors, (0), 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-28 02:49:14,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 0 states have call successors, (0), 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-28 02:49:14,868 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 0 states have call successors, (0), 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-28 02:49:14,868 INFO L186 Difference]: Start difference. First operand has 169 places, 165 transitions, 803 flow. Second operand 16 states and 1988 transitions. [2021-12-28 02:49:14,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 310 transitions, 2111 flow [2021-12-28 02:49:17,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 310 transitions, 2008 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:17,728 INFO L242 Difference]: Finished difference. Result has 184 places, 191 transitions, 1169 flow [2021-12-28 02:49:17,728 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1169, PETRI_PLACES=184, PETRI_TRANSITIONS=191} [2021-12-28 02:49:17,729 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 37 predicate places. [2021-12-28 02:49:17,729 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 191 transitions, 1169 flow [2021-12-28 02:49:17,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 0 states have call successors, (0), 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-28 02:49:17,730 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:17,730 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] [2021-12-28 02:49:17,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:49:17,730 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash -261399751, now seen corresponding path program 1 times [2021-12-28 02:49:17,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:17,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004959526] [2021-12-28 02:49:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:17,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:17,845 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-28 02:49:17,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:17,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004959526] [2021-12-28 02:49:17,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004959526] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:17,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:17,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:49:17,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965048827] [2021-12-28 02:49:17,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:17,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:49:17,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:17,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:49:17,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:49:17,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-28 02:49:17,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 191 transitions, 1169 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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-28 02:49:17,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:17,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-28 02:49:17,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:21,257 INFO L129 PetriNetUnfolder]: 13279/23908 cut-off events. [2021-12-28 02:49:21,257 INFO L130 PetriNetUnfolder]: For 79997/86088 co-relation queries the response was YES. [2021-12-28 02:49:21,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87931 conditions, 23908 events. 13279/23908 cut-off events. For 79997/86088 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 221192 event pairs, 833 based on Foata normal form. 181/23268 useless extension candidates. Maximal degree in co-relation 87842. Up to 2948 conditions per place. [2021-12-28 02:49:21,438 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 105 selfloop transitions, 63 changer transitions 38/309 dead transitions. [2021-12-28 02:49:21,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 309 transitions, 2224 flow [2021-12-28 02:49:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 02:49:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-28 02:49:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2312 transitions. [2021-12-28 02:49:21,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.869172932330827 [2021-12-28 02:49:21,442 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2312 transitions. [2021-12-28 02:49:21,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2312 transitions. [2021-12-28 02:49:21,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:21,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2312 transitions. [2021-12-28 02:49:21,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 121.6842105263158) internal successors, (2312), 19 states have internal predecessors, (2312), 0 states have call successors, (0), 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-28 02:49:21,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 0 states have call successors, (0), 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-28 02:49:21,451 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 0 states have call successors, (0), 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-28 02:49:21,451 INFO L186 Difference]: Start difference. First operand has 184 places, 191 transitions, 1169 flow. Second operand 19 states and 2312 transitions. [2021-12-28 02:49:21,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 309 transitions, 2224 flow [2021-12-28 02:49:24,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 309 transitions, 1828 flow, removed 154 selfloop flow, removed 12 redundant places. [2021-12-28 02:49:24,250 INFO L242 Difference]: Finished difference. Result has 197 places, 190 transitions, 1016 flow [2021-12-28 02:49:24,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1016, PETRI_PLACES=197, PETRI_TRANSITIONS=190} [2021-12-28 02:49:24,251 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 50 predicate places. [2021-12-28 02:49:24,251 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 190 transitions, 1016 flow [2021-12-28 02:49:24,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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-28 02:49:24,251 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:24,251 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, 1, 1, 1] [2021-12-28 02:49:24,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 02:49:24,251 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash -704600793, now seen corresponding path program 1 times [2021-12-28 02:49:24,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:24,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517137360] [2021-12-28 02:49:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:24,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:24,350 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-28 02:49:24,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:24,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517137360] [2021-12-28 02:49:24,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517137360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:24,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:24,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:24,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490334570] [2021-12-28 02:49:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:24,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:24,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:24,353 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-12-28 02:49:24,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 190 transitions, 1016 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 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-28 02:49:24,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:24,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-12-28 02:49:24,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:25,432 INFO L129 PetriNetUnfolder]: 3550/12290 cut-off events. [2021-12-28 02:49:25,433 INFO L130 PetriNetUnfolder]: For 25844/27162 co-relation queries the response was YES. [2021-12-28 02:49:25,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38170 conditions, 12290 events. 3550/12290 cut-off events. For 25844/27162 co-relation queries the response was YES. Maximal size of possible extension queue 1570. Compared 165492 event pairs, 172 based on Foata normal form. 1/11533 useless extension candidates. Maximal degree in co-relation 38084. Up to 1335 conditions per place. [2021-12-28 02:49:25,566 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 28 selfloop transitions, 5 changer transitions 5/204 dead transitions. [2021-12-28 02:49:25,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 204 transitions, 1142 flow [2021-12-28 02:49:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 02:49:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 02:49:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2021-12-28 02:49:25,567 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2021-12-28 02:49:25,568 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2021-12-28 02:49:25,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2021-12-28 02:49:25,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:25,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2021-12-28 02:49:25,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 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-28 02:49:25,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 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-28 02:49:25,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 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-28 02:49:25,571 INFO L186 Difference]: Start difference. First operand has 197 places, 190 transitions, 1016 flow. Second operand 6 states and 724 transitions. [2021-12-28 02:49:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 204 transitions, 1142 flow [2021-12-28 02:49:26,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 204 transitions, 996 flow, removed 25 selfloop flow, removed 17 redundant places. [2021-12-28 02:49:26,550 INFO L242 Difference]: Finished difference. Result has 186 places, 192 transitions, 917 flow [2021-12-28 02:49:26,551 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=917, PETRI_PLACES=186, PETRI_TRANSITIONS=192} [2021-12-28 02:49:26,551 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 39 predicate places. [2021-12-28 02:49:26,551 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 192 transitions, 917 flow [2021-12-28 02:49:26,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 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-28 02:49:26,552 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:26,552 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, 1, 1, 1] [2021-12-28 02:49:26,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 02:49:26,552 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash 938751447, now seen corresponding path program 2 times [2021-12-28 02:49:26,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:26,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299330990] [2021-12-28 02:49:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:26,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:26,653 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-28 02:49:26,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:26,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299330990] [2021-12-28 02:49:26,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299330990] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:26,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:26,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:49:26,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062928211] [2021-12-28 02:49:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:26,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:49:26,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:49:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:49:26,656 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2021-12-28 02:49:26,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 192 transitions, 917 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:26,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:26,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2021-12-28 02:49:26,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:28,449 INFO L129 PetriNetUnfolder]: 6164/19556 cut-off events. [2021-12-28 02:49:28,450 INFO L130 PetriNetUnfolder]: For 27707/28794 co-relation queries the response was YES. [2021-12-28 02:49:28,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53859 conditions, 19556 events. 6164/19556 cut-off events. For 27707/28794 co-relation queries the response was YES. Maximal size of possible extension queue 2565. Compared 272569 event pairs, 226 based on Foata normal form. 8/18199 useless extension candidates. Maximal degree in co-relation 53830. Up to 1964 conditions per place. [2021-12-28 02:49:28,727 INFO L132 encePairwiseOnDemand]: 126/140 looper letters, 51 selfloop transitions, 21 changer transitions 27/251 dead transitions. [2021-12-28 02:49:28,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 251 transitions, 1384 flow [2021-12-28 02:49:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1038 transitions. [2021-12-28 02:49:28,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8238095238095238 [2021-12-28 02:49:28,729 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1038 transitions. [2021-12-28 02:49:28,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1038 transitions. [2021-12-28 02:49:28,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:28,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1038 transitions. [2021-12-28 02:49:28,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:28,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-28 02:49:28,733 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-28 02:49:28,733 INFO L186 Difference]: Start difference. First operand has 186 places, 192 transitions, 917 flow. Second operand 9 states and 1038 transitions. [2021-12-28 02:49:28,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 251 transitions, 1384 flow [2021-12-28 02:49:31,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 251 transitions, 1360 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:31,035 INFO L242 Difference]: Finished difference. Result has 192 places, 199 transitions, 1013 flow [2021-12-28 02:49:31,035 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1013, PETRI_PLACES=192, PETRI_TRANSITIONS=199} [2021-12-28 02:49:31,036 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 45 predicate places. [2021-12-28 02:49:31,036 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 199 transitions, 1013 flow [2021-12-28 02:49:31,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:31,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:31,037 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, 1, 1, 1] [2021-12-28 02:49:31,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 02:49:31,037 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 506796017, now seen corresponding path program 3 times [2021-12-28 02:49:31,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:31,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668524779] [2021-12-28 02:49:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:31,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:31,141 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-28 02:49:31,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:31,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668524779] [2021-12-28 02:49:31,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668524779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:31,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:31,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:49:31,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774390200] [2021-12-28 02:49:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:31,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:49:31,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:49:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:49:31,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2021-12-28 02:49:31,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 199 transitions, 1013 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:31,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:31,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2021-12-28 02:49:31,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:33,073 INFO L129 PetriNetUnfolder]: 6265/20285 cut-off events. [2021-12-28 02:49:33,074 INFO L130 PetriNetUnfolder]: For 29535/30926 co-relation queries the response was YES. [2021-12-28 02:49:33,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56058 conditions, 20285 events. 6265/20285 cut-off events. For 29535/30926 co-relation queries the response was YES. Maximal size of possible extension queue 2794. Compared 287604 event pairs, 183 based on Foata normal form. 89/18880 useless extension candidates. Maximal degree in co-relation 56027. Up to 2248 conditions per place. [2021-12-28 02:49:33,508 INFO L132 encePairwiseOnDemand]: 126/140 looper letters, 42 selfloop transitions, 18 changer transitions 32/245 dead transitions. [2021-12-28 02:49:33,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 245 transitions, 1410 flow [2021-12-28 02:49:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1030 transitions. [2021-12-28 02:49:33,511 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2021-12-28 02:49:33,511 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1030 transitions. [2021-12-28 02:49:33,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1030 transitions. [2021-12-28 02:49:33,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:33,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1030 transitions. [2021-12-28 02:49:33,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.44444444444444) internal successors, (1030), 9 states have internal predecessors, (1030), 0 states have call successors, (0), 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-28 02:49:33,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-28 02:49:33,515 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-28 02:49:33,515 INFO L186 Difference]: Start difference. First operand has 192 places, 199 transitions, 1013 flow. Second operand 9 states and 1030 transitions. [2021-12-28 02:49:33,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 245 transitions, 1410 flow [2021-12-28 02:49:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 245 transitions, 1396 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:35,228 INFO L242 Difference]: Finished difference. Result has 197 places, 195 transitions, 1019 flow [2021-12-28 02:49:35,229 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=197, PETRI_TRANSITIONS=195} [2021-12-28 02:49:35,229 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 50 predicate places. [2021-12-28 02:49:35,229 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 195 transitions, 1019 flow [2021-12-28 02:49:35,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:35,230 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:35,230 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, 1, 1, 1] [2021-12-28 02:49:35,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 02:49:35,230 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash -206356371, now seen corresponding path program 4 times [2021-12-28 02:49:35,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:35,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411020964] [2021-12-28 02:49:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:35,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:35,484 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-28 02:49:35,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:35,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411020964] [2021-12-28 02:49:35,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411020964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:35,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:35,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 02:49:35,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39944915] [2021-12-28 02:49:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:35,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 02:49:35,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 02:49:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-28 02:49:35,487 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2021-12-28 02:49:35,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 195 transitions, 1019 flow. Second operand has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 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-28 02:49:35,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:35,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2021-12-28 02:49:35,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:37,445 INFO L129 PetriNetUnfolder]: 5676/18823 cut-off events. [2021-12-28 02:49:37,445 INFO L130 PetriNetUnfolder]: For 29261/29661 co-relation queries the response was YES. [2021-12-28 02:49:37,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52920 conditions, 18823 events. 5676/18823 cut-off events. For 29261/29661 co-relation queries the response was YES. Maximal size of possible extension queue 2244. Compared 269961 event pairs, 111 based on Foata normal form. 3/17812 useless extension candidates. Maximal degree in co-relation 52887. Up to 1904 conditions per place. [2021-12-28 02:49:37,554 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 37 selfloop transitions, 8 changer transitions 10/219 dead transitions. [2021-12-28 02:49:37,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 219 transitions, 1223 flow [2021-12-28 02:49:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 02:49:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-28 02:49:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1335 transitions. [2021-12-28 02:49:37,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2021-12-28 02:49:37,557 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1335 transitions. [2021-12-28 02:49:37,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1335 transitions. [2021-12-28 02:49:37,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:37,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1335 transitions. [2021-12-28 02:49:37,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 111.25) internal successors, (1335), 12 states have internal predecessors, (1335), 0 states have call successors, (0), 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-28 02:49:37,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 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-28 02:49:37,561 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 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-28 02:49:37,561 INFO L186 Difference]: Start difference. First operand has 197 places, 195 transitions, 1019 flow. Second operand 12 states and 1335 transitions. [2021-12-28 02:49:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 219 transitions, 1223 flow [2021-12-28 02:49:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 219 transitions, 1184 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-12-28 02:49:39,518 INFO L242 Difference]: Finished difference. Result has 205 places, 195 transitions, 1018 flow [2021-12-28 02:49:39,518 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1018, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2021-12-28 02:49:39,519 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 58 predicate places. [2021-12-28 02:49:39,519 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 1018 flow [2021-12-28 02:49:39,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 109.0) internal successors, (1526), 14 states have internal predecessors, (1526), 0 states have call successors, (0), 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-28 02:49:39,519 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:39,519 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, 1, 1, 1] [2021-12-28 02:49:39,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 02:49:39,520 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -265322101, now seen corresponding path program 5 times [2021-12-28 02:49:39,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:39,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26112302] [2021-12-28 02:49:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:39,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:49:39,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:49:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:49:39,616 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:49:39,616 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:49:39,617 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-28 02:49:39,618 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-28 02:49:39,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-28 02:49:39,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-28 02:49:39,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-28 02:49:39,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-28 02:49:39,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-28 02:49:39,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 02:49:39,622 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:39,625 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-28 02:49:39,625 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:49:39,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:49:39 BasicIcfg [2021-12-28 02:49:39,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:49:39,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:49:39,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:49:39,755 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:49:39,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:48:57" (3/4) ... [2021-12-28 02:49:39,756 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:49:39,855 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:49:39,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:49:39,856 INFO L158 Benchmark]: Toolchain (without parser) took 43303.49ms. Allocated memory was 69.2MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 49.5MB in the beginning and 4.6GB in the end (delta: -4.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-28 02:49:39,856 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 50.0MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:49:39,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.73ms. Allocated memory is still 69.2MB. Free memory was 49.4MB in the beginning and 38.0MB in the end (delta: 11.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2021-12-28 02:49:39,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.35ms. Allocated memory is still 69.2MB. Free memory was 38.0MB in the beginning and 35.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:49:39,857 INFO L158 Benchmark]: Boogie Preprocessor took 43.07ms. Allocated memory is still 69.2MB. Free memory was 35.4MB in the beginning and 32.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 02:49:39,857 INFO L158 Benchmark]: RCFGBuilder took 832.65ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 32.9MB in the beginning and 42.5MB in the end (delta: -9.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2021-12-28 02:49:39,857 INFO L158 Benchmark]: TraceAbstraction took 41780.77ms. Allocated memory was 96.5MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 41.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-28 02:49:39,857 INFO L158 Benchmark]: Witness Printer took 100.38ms. Allocated memory is still 6.3GB. Free memory was 4.7GB in the beginning and 4.6GB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2021-12-28 02:49:39,859 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.16ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 50.0MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.73ms. Allocated memory is still 69.2MB. Free memory was 49.4MB in the beginning and 38.0MB in the end (delta: 11.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.35ms. Allocated memory is still 69.2MB. Free memory was 38.0MB in the beginning and 35.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.07ms. Allocated memory is still 69.2MB. Free memory was 35.4MB in the beginning and 32.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 832.65ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 32.9MB in the beginning and 42.5MB in the end (delta: -9.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 41780.77ms. Allocated memory was 96.5MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 41.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 100.38ms. Allocated memory is still 6.3GB. Free memory was 4.7GB in the beginning and 4.6GB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool b$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0] [L724] 0 int b$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0] [L725] 0 _Bool b$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0] [L726] 0 _Bool b$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0] [L727] 0 _Bool b$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0] [L728] 0 _Bool b$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0] [L729] 0 _Bool b$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0] [L730] 0 _Bool b$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0] [L731] 0 _Bool b$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0] [L732] 0 _Bool b$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0] [L733] 0 _Bool b$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0] [L734] 0 _Bool b$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0] [L735] 0 _Bool b$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0] [L736] 0 int *b$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}] [L737] 0 int b$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0] [L738] 0 _Bool b$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0] [L739] 0 int b$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0] [L740] 0 _Bool b$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0] [L741] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0] [L742] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L744] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1129; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 874]: 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: 872]: 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, 178 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: 41.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 39.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 940 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 940 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1584 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1949 IncrementalHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 158 mSDtfsCounter, 1949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1169occurred in iteration=6, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 4776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-28 02:49:39,898 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