./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix018.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix018.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:21:44,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:21:44,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:21:44,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:21:44,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:21:44,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:21:44,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:21:44,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:21:44,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:21:44,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:21:44,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:21:44,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:21:44,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:21:44,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:21:44,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:21:44,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:21:44,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:21:44,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:21:44,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:21:44,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:21:44,956 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:21:44,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:21:44,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:21:44,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:21:44,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:21:44,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:21:44,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:21:44,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:21:44,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:21:44,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:21:44,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:21:44,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:21:44,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:21:44,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:21:44,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:21:44,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:21:44,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:21:44,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:21:44,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:21:44,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:21:44,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:21:44,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:21:44,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:21:45,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:21:45,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:21:45,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:21:45,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:21:45,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:21:45,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:21:45,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:21:45,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:21:45,012 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:21:45,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:21:45,013 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:21:45,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:21:45,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:21:45,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:21:45,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:21:45,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:21:45,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:21:45,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:21:45,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:21:45,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:21:45,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:21:45,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:21:45,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:21:45,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:21:45,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:21:45,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:21:45,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:21:45,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:21:45,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:21:45,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:21:45,018 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:21:45,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:21:45,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:21:45,018 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 -> a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 [2022-07-22 21:21:45,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:21:45,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:21:45,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:21:45,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:21:45,254 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:21:45,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix018.opt.i [2022-07-22 21:21:45,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bdcacd3/e32dc8f7b7954d20b0a3eb682d30cbd1/FLAGbe12a21b7 [2022-07-22 21:21:45,835 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:21:45,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018.opt.i [2022-07-22 21:21:45,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bdcacd3/e32dc8f7b7954d20b0a3eb682d30cbd1/FLAGbe12a21b7 [2022-07-22 21:21:46,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bdcacd3/e32dc8f7b7954d20b0a3eb682d30cbd1 [2022-07-22 21:21:46,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:21:46,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:21:46,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:21:46,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:21:46,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:21:46,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4436c23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46, skipping insertion in model container [2022-07-22 21:21:46,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:21:46,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:21:46,367 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/mix018.opt.i[944,957] [2022-07-22 21:21:46,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:21:46,597 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:21:46,609 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/mix018.opt.i[944,957] [2022-07-22 21:21:46,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:21:46,717 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:21:46,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46 WrapperNode [2022-07-22 21:21:46,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:21:46,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:21:46,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:21:46,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:21:46,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,780 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 295 [2022-07-22 21:21:46,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:21:46,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:21:46,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:21:46,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:21:46,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:21:46,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:21:46,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:21:46,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:21:46,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (1/1) ... [2022-07-22 21:21:46,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:21:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:21:46,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 21:21:46,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 21:21:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:21:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:21:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:21:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:21:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:21:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:21:46,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:21:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:21:46,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:21:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-22 21:21:46,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-22 21:21:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-22 21:21:46,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-22 21:21:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:21:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:21:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:21:46,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:21:46,900 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:21:47,063 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:21:47,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:21:47,637 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:21:47,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:21:47,951 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:21:47,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:21:47 BoogieIcfgContainer [2022-07-22 21:21:47,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:21:47,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:21:47,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:21:47,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:21:47,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:21:46" (1/3) ... [2022-07-22 21:21:47,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eecb3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:21:47, skipping insertion in model container [2022-07-22 21:21:47,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:46" (2/3) ... [2022-07-22 21:21:47,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eecb3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:21:47, skipping insertion in model container [2022-07-22 21:21:47,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:21:47" (3/3) ... [2022-07-22 21:21:47,960 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2022-07-22 21:21:47,965 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:21:47,971 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:21:47,971 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:21:47,971 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:21:48,029 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:21:48,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-07-22 21:21:48,094 INFO L129 PetriNetUnfolder]: 2/131 cut-off events. [2022-07-22 21:21:48,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:21:48,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-07-22 21:21:48,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2022-07-22 21:21:48,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2022-07-22 21:21:48,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:21:48,116 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6312c4c2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52758bea [2022-07-22 21:21:48,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-22 21:21:48,130 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2022-07-22 21:21:48,131 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:21:48,131 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:48,131 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:48,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash -193157899, now seen corresponding path program 1 times [2022-07-22 21:21:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:48,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407060792] [2022-07-22 21:21:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407060792] [2022-07-22 21:21:48,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407060792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:48,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:48,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:21:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427924447] [2022-07-22 21:21:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:48,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:21:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:48,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:21:48,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:21:48,475 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 135 [2022-07-22 21:21:48,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:48,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:48,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 135 [2022-07-22 21:21:48,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:48,597 INFO L129 PetriNetUnfolder]: 14/170 cut-off events. [2022-07-22 21:21:48,597 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-22 21:21:48,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 170 events. 14/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 273 event pairs, 2 based on Foata normal form. 5/166 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2022-07-22 21:21:48,600 INFO L132 encePairwiseOnDemand]: 130/135 looper letters, 10 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2022-07-22 21:21:48,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 129 transitions, 294 flow [2022-07-22 21:21:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:21:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:21:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-07-22 21:21:48,613 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9382716049382716 [2022-07-22 21:21:48,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2022-07-22 21:21:48,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2022-07-22 21:21:48,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:48,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2022-07-22 21:21:48,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:48,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:48,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:48,627 INFO L186 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 3 states and 380 transitions. [2022-07-22 21:21:48,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 129 transitions, 294 flow [2022-07-22 21:21:48,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:21:48,634 INFO L242 Difference]: Finished difference. Result has 138 places, 127 transitions, 266 flow [2022-07-22 21:21:48,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2022-07-22 21:21:48,638 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -4 predicate places. [2022-07-22 21:21:48,639 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 266 flow [2022-07-22 21:21:48,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:48,639 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:48,640 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:48,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:21:48,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2039374663, now seen corresponding path program 1 times [2022-07-22 21:21:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:48,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358729179] [2022-07-22 21:21:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:48,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358729179] [2022-07-22 21:21:48,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358729179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:48,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:48,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:21:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768502350] [2022-07-22 21:21:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:48,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:21:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:48,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:21:48,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:21:48,840 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 135 [2022-07-22 21:21:48,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:48,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:48,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 135 [2022-07-22 21:21:48,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:49,117 INFO L129 PetriNetUnfolder]: 84/440 cut-off events. [2022-07-22 21:21:49,117 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-07-22 21:21:49,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 440 events. 84/440 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1989 event pairs, 20 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 581. Up to 65 conditions per place. [2022-07-22 21:21:49,121 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 16 selfloop transitions, 2 changer transitions 38/153 dead transitions. [2022-07-22 21:21:49,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 153 transitions, 410 flow [2022-07-22 21:21:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:21:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:21:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2022-07-22 21:21:49,127 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8814814814814815 [2022-07-22 21:21:49,127 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2022-07-22 21:21:49,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2022-07-22 21:21:49,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:49,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2022-07-22 21:21:49,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:49,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:49,134 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:49,135 INFO L186 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 9 states and 1071 transitions. [2022-07-22 21:21:49,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 153 transitions, 410 flow [2022-07-22 21:21:49,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 153 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:21:49,138 INFO L242 Difference]: Finished difference. Result has 151 places, 113 transitions, 254 flow [2022-07-22 21:21:49,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=254, PETRI_PLACES=151, PETRI_TRANSITIONS=113} [2022-07-22 21:21:49,139 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2022-07-22 21:21:49,140 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 113 transitions, 254 flow [2022-07-22 21:21:49,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:49,140 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:49,141 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:49,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:21:49,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:49,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1913398270, now seen corresponding path program 1 times [2022-07-22 21:21:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:49,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296211350] [2022-07-22 21:21:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:49,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:49,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296211350] [2022-07-22 21:21:49,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296211350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:49,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:49,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:49,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592322065] [2022-07-22 21:21:49,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:49,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:49,424 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 135 [2022-07-22 21:21:49,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 113 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:49,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:49,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 135 [2022-07-22 21:21:49,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:50,266 INFO L129 PetriNetUnfolder]: 1189/2604 cut-off events. [2022-07-22 21:21:50,266 INFO L130 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2022-07-22 21:21:50,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5077 conditions, 2604 events. 1189/2604 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18303 event pairs, 347 based on Foata normal form. 53/2562 useless extension candidates. Maximal degree in co-relation 5009. Up to 876 conditions per place. [2022-07-22 21:21:50,288 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 38 selfloop transitions, 11 changer transitions 59/197 dead transitions. [2022-07-22 21:21:50,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 197 transitions, 694 flow [2022-07-22 21:21:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:21:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:21:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1489 transitions. [2022-07-22 21:21:50,294 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8484330484330485 [2022-07-22 21:21:50,294 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1489 transitions. [2022-07-22 21:21:50,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1489 transitions. [2022-07-22 21:21:50,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:50,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1489 transitions. [2022-07-22 21:21:50,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.53846153846153) internal successors, (1489), 13 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:50,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:50,304 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:50,304 INFO L186 Difference]: Start difference. First operand has 151 places, 113 transitions, 254 flow. Second operand 13 states and 1489 transitions. [2022-07-22 21:21:50,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 197 transitions, 694 flow [2022-07-22 21:21:50,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 197 transitions, 638 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-07-22 21:21:50,325 INFO L242 Difference]: Finished difference. Result has 146 places, 120 transitions, 337 flow [2022-07-22 21:21:50,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=337, PETRI_PLACES=146, PETRI_TRANSITIONS=120} [2022-07-22 21:21:50,326 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 4 predicate places. [2022-07-22 21:21:50,326 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 120 transitions, 337 flow [2022-07-22 21:21:50,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:50,327 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:50,327 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:50,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:21:50,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1977425509, now seen corresponding path program 1 times [2022-07-22 21:21:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:50,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604800056] [2022-07-22 21:21:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:50,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604800056] [2022-07-22 21:21:50,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604800056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:50,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:50,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:21:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135128189] [2022-07-22 21:21:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:21:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:21:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:21:50,488 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-07-22 21:21:50,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 120 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:50,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:50,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-07-22 21:21:50,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:52,825 INFO L129 PetriNetUnfolder]: 7286/12482 cut-off events. [2022-07-22 21:21:52,825 INFO L130 PetriNetUnfolder]: For 13422/15140 co-relation queries the response was YES. [2022-07-22 21:21:52,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31655 conditions, 12482 events. 7286/12482 cut-off events. For 13422/15140 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 101774 event pairs, 621 based on Foata normal form. 12/11259 useless extension candidates. Maximal degree in co-relation 31583. Up to 4173 conditions per place. [2022-07-22 21:21:52,958 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 85 selfloop transitions, 20 changer transitions 0/202 dead transitions. [2022-07-22 21:21:52,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 202 transitions, 843 flow [2022-07-22 21:21:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:21:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:21:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1191 transitions. [2022-07-22 21:21:52,962 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8822222222222222 [2022-07-22 21:21:52,963 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1191 transitions. [2022-07-22 21:21:52,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1191 transitions. [2022-07-22 21:21:52,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:52,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1191 transitions. [2022-07-22 21:21:52,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.1) internal successors, (1191), 10 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:52,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:52,969 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:52,969 INFO L186 Difference]: Start difference. First operand has 146 places, 120 transitions, 337 flow. Second operand 10 states and 1191 transitions. [2022-07-22 21:21:52,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 202 transitions, 843 flow [2022-07-22 21:21:52,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 202 transitions, 831 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-07-22 21:21:52,999 INFO L242 Difference]: Finished difference. Result has 146 places, 138 transitions, 468 flow [2022-07-22 21:21:53,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=468, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2022-07-22 21:21:53,000 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 4 predicate places. [2022-07-22 21:21:53,001 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 468 flow [2022-07-22 21:21:53,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:53,001 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:53,002 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:53,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:21:53,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1716581180, now seen corresponding path program 1 times [2022-07-22 21:21:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:53,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289289479] [2022-07-22 21:21:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:53,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289289479] [2022-07-22 21:21:53,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289289479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:53,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:53,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:21:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847664848] [2022-07-22 21:21:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:53,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:21:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:53,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:21:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:21:53,129 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2022-07-22 21:21:53,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:53,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:53,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2022-07-22 21:21:53,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:54,359 INFO L129 PetriNetUnfolder]: 2099/6585 cut-off events. [2022-07-22 21:21:54,360 INFO L130 PetriNetUnfolder]: For 8049/9557 co-relation queries the response was YES. [2022-07-22 21:21:54,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17902 conditions, 6585 events. 2099/6585 cut-off events. For 8049/9557 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 70939 event pairs, 849 based on Foata normal form. 112/6160 useless extension candidates. Maximal degree in co-relation 17827. Up to 1638 conditions per place. [2022-07-22 21:21:54,441 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 45 selfloop transitions, 12 changer transitions 0/172 dead transitions. [2022-07-22 21:21:54,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 172 transitions, 741 flow [2022-07-22 21:21:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:21:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:21:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1063 transitions. [2022-07-22 21:21:54,445 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8748971193415638 [2022-07-22 21:21:54,445 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1063 transitions. [2022-07-22 21:21:54,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1063 transitions. [2022-07-22 21:21:54,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:54,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1063 transitions. [2022-07-22 21:21:54,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:54,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:54,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:54,451 INFO L186 Difference]: Start difference. First operand has 146 places, 138 transitions, 468 flow. Second operand 9 states and 1063 transitions. [2022-07-22 21:21:54,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 172 transitions, 741 flow [2022-07-22 21:21:54,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 172 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:21:54,479 INFO L242 Difference]: Finished difference. Result has 160 places, 146 transitions, 560 flow [2022-07-22 21:21:54,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=160, PETRI_TRANSITIONS=146} [2022-07-22 21:21:54,482 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2022-07-22 21:21:54,482 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 146 transitions, 560 flow [2022-07-22 21:21:54,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:54,483 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:54,483 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:54,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:21:54,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash 671914646, now seen corresponding path program 1 times [2022-07-22 21:21:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:54,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288016402] [2022-07-22 21:21:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:54,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:54,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288016402] [2022-07-22 21:21:54,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288016402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:54,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:54,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081539048] [2022-07-22 21:21:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:54,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:54,613 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-07-22 21:21:54,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 146 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:54,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:54,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-07-22 21:21:54,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:57,261 INFO L129 PetriNetUnfolder]: 9521/17020 cut-off events. [2022-07-22 21:21:57,261 INFO L130 PetriNetUnfolder]: For 43427/47554 co-relation queries the response was YES. [2022-07-22 21:21:57,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61078 conditions, 17020 events. 9521/17020 cut-off events. For 43427/47554 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 152994 event pairs, 553 based on Foata normal form. 651/16602 useless extension candidates. Maximal degree in co-relation 60996. Up to 5066 conditions per place. [2022-07-22 21:21:57,392 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 101 selfloop transitions, 34 changer transitions 13/253 dead transitions. [2022-07-22 21:21:57,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 253 transitions, 1456 flow [2022-07-22 21:21:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:21:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:21:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1552 transitions. [2022-07-22 21:21:57,397 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8843304843304843 [2022-07-22 21:21:57,397 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1552 transitions. [2022-07-22 21:21:57,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1552 transitions. [2022-07-22 21:21:57,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:57,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1552 transitions. [2022-07-22 21:21:57,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.38461538461539) internal successors, (1552), 13 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:57,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:57,406 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:57,406 INFO L186 Difference]: Start difference. First operand has 160 places, 146 transitions, 560 flow. Second operand 13 states and 1552 transitions. [2022-07-22 21:21:57,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 253 transitions, 1456 flow [2022-07-22 21:21:57,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 253 transitions, 1444 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-07-22 21:21:57,584 INFO L242 Difference]: Finished difference. Result has 177 places, 162 transitions, 801 flow [2022-07-22 21:21:57,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=801, PETRI_PLACES=177, PETRI_TRANSITIONS=162} [2022-07-22 21:21:57,587 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 35 predicate places. [2022-07-22 21:21:57,587 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 162 transitions, 801 flow [2022-07-22 21:21:57,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:57,588 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:57,588 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:57,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:21:57,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -573530045, now seen corresponding path program 1 times [2022-07-22 21:21:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:57,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144659560] [2022-07-22 21:21:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:57,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:57,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144659560] [2022-07-22 21:21:57,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144659560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:57,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:57,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:21:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821877512] [2022-07-22 21:21:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:21:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:21:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:21:57,736 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-07-22 21:21:57,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 162 transitions, 801 flow. Second operand has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:57,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:57,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-07-22 21:21:57,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:00,556 INFO L129 PetriNetUnfolder]: 8486/16024 cut-off events. [2022-07-22 21:22:00,557 INFO L130 PetriNetUnfolder]: For 75916/82427 co-relation queries the response was YES. [2022-07-22 21:22:00,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69139 conditions, 16024 events. 8486/16024 cut-off events. For 75916/82427 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 152994 event pairs, 270 based on Foata normal form. 929/15973 useless extension candidates. Maximal degree in co-relation 69049. Up to 4295 conditions per place. [2022-07-22 21:22:00,685 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 100 selfloop transitions, 50 changer transitions 47/294 dead transitions. [2022-07-22 21:22:00,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 294 transitions, 2099 flow [2022-07-22 21:22:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 21:22:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-22 21:22:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1908 transitions. [2022-07-22 21:22:00,691 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2022-07-22 21:22:00,691 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1908 transitions. [2022-07-22 21:22:00,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1908 transitions. [2022-07-22 21:22:00,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:00,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1908 transitions. [2022-07-22 21:22:00,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.25) internal successors, (1908), 16 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:00,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:00,702 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:00,702 INFO L186 Difference]: Start difference. First operand has 177 places, 162 transitions, 801 flow. Second operand 16 states and 1908 transitions. [2022-07-22 21:22:00,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 294 transitions, 2099 flow [2022-07-22 21:22:02,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 294 transitions, 2005 flow, removed 37 selfloop flow, removed 5 redundant places. [2022-07-22 21:22:02,072 INFO L242 Difference]: Finished difference. Result has 193 places, 175 transitions, 1062 flow [2022-07-22 21:22:02,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1062, PETRI_PLACES=193, PETRI_TRANSITIONS=175} [2022-07-22 21:22:02,073 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 51 predicate places. [2022-07-22 21:22:02,073 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 175 transitions, 1062 flow [2022-07-22 21:22:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:02,073 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:02,073 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:02,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:22:02,074 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:22:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash -795821873, now seen corresponding path program 1 times [2022-07-22 21:22:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906824726] [2022-07-22 21:22:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:22:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906824726] [2022-07-22 21:22:02,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906824726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:02,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:02,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:22:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938317507] [2022-07-22 21:22:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:02,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:22:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:22:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:22:02,251 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2022-07-22 21:22:02,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 175 transitions, 1062 flow. Second operand has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:02,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:02,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2022-07-22 21:22:02,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:03,492 INFO L129 PetriNetUnfolder]: 2566/9312 cut-off events. [2022-07-22 21:22:03,492 INFO L130 PetriNetUnfolder]: For 46079/47766 co-relation queries the response was YES. [2022-07-22 21:22:03,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36340 conditions, 9312 events. 2566/9312 cut-off events. For 46079/47766 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 119901 event pairs, 69 based on Foata normal form. 31/8858 useless extension candidates. Maximal degree in co-relation 36239. Up to 2187 conditions per place. [2022-07-22 21:22:03,593 INFO L132 encePairwiseOnDemand]: 121/135 looper letters, 52 selfloop transitions, 20 changer transitions 19/233 dead transitions. [2022-07-22 21:22:03,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 233 transitions, 1586 flow [2022-07-22 21:22:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:22:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:22:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1229 transitions. [2022-07-22 21:22:03,597 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8276094276094276 [2022-07-22 21:22:03,597 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1229 transitions. [2022-07-22 21:22:03,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1229 transitions. [2022-07-22 21:22:03,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:03,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1229 transitions. [2022-07-22 21:22:03,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.72727272727273) internal successors, (1229), 11 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:03,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 135.0) internal successors, (1620), 12 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:03,604 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 135.0) internal successors, (1620), 12 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:03,604 INFO L186 Difference]: Start difference. First operand has 193 places, 175 transitions, 1062 flow. Second operand 11 states and 1229 transitions. [2022-07-22 21:22:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 233 transitions, 1586 flow [2022-07-22 21:22:05,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 233 transitions, 1365 flow, removed 88 selfloop flow, removed 13 redundant places. [2022-07-22 21:22:05,288 INFO L242 Difference]: Finished difference. Result has 193 places, 187 transitions, 1082 flow [2022-07-22 21:22:05,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1082, PETRI_PLACES=193, PETRI_TRANSITIONS=187} [2022-07-22 21:22:05,289 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 51 predicate places. [2022-07-22 21:22:05,289 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 187 transitions, 1082 flow [2022-07-22 21:22:05,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:05,289 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:05,290 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:05,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:22:05,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:22:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1434667739, now seen corresponding path program 2 times [2022-07-22 21:22:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:05,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863749161] [2022-07-22 21:22:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:22:05,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:05,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863749161] [2022-07-22 21:22:05,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863749161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:05,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:05,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:22:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031594092] [2022-07-22 21:22:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:22:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:22:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:22:05,422 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2022-07-22 21:22:05,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 187 transitions, 1082 flow. Second operand has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:05,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:05,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2022-07-22 21:22:05,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:06,899 INFO L129 PetriNetUnfolder]: 3462/12439 cut-off events. [2022-07-22 21:22:06,900 INFO L130 PetriNetUnfolder]: For 32063/32925 co-relation queries the response was YES. [2022-07-22 21:22:06,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39651 conditions, 12439 events. 3462/12439 cut-off events. For 32063/32925 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 170300 event pairs, 71 based on Foata normal form. 40/11799 useless extension candidates. Maximal degree in co-relation 39544. Up to 1495 conditions per place. [2022-07-22 21:22:07,004 INFO L132 encePairwiseOnDemand]: 121/135 looper letters, 67 selfloop transitions, 18 changer transitions 21/248 dead transitions. [2022-07-22 21:22:07,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 248 transitions, 1800 flow [2022-07-22 21:22:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:22:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:22:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1027 transitions. [2022-07-22 21:22:07,008 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8452674897119341 [2022-07-22 21:22:07,008 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1027 transitions. [2022-07-22 21:22:07,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1027 transitions. [2022-07-22 21:22:07,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:07,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1027 transitions. [2022-07-22 21:22:07,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:07,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:07,015 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:07,015 INFO L186 Difference]: Start difference. First operand has 193 places, 187 transitions, 1082 flow. Second operand 9 states and 1027 transitions. [2022-07-22 21:22:07,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 248 transitions, 1800 flow [2022-07-22 21:22:07,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 248 transitions, 1666 flow, removed 67 selfloop flow, removed 6 redundant places. [2022-07-22 21:22:07,817 INFO L242 Difference]: Finished difference. Result has 195 places, 190 transitions, 1164 flow [2022-07-22 21:22:07,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1164, PETRI_PLACES=195, PETRI_TRANSITIONS=190} [2022-07-22 21:22:07,817 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 53 predicate places. [2022-07-22 21:22:07,818 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 190 transitions, 1164 flow [2022-07-22 21:22:07,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:07,818 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:07,818 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:07,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:22:07,818 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:22:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1734904919, now seen corresponding path program 3 times [2022-07-22 21:22:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26131602] [2022-07-22 21:22:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:22:08,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:08,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26131602] [2022-07-22 21:22:08,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26131602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:08,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:08,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:22:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720572188] [2022-07-22 21:22:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:22:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:08,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:22:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:22:08,038 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-07-22 21:22:08,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 190 transitions, 1164 flow. Second operand has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:08,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:08,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-07-22 21:22:08,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:12,485 INFO L129 PetriNetUnfolder]: 13025/26992 cut-off events. [2022-07-22 21:22:12,485 INFO L130 PetriNetUnfolder]: For 136981/151041 co-relation queries the response was YES. [2022-07-22 21:22:12,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110959 conditions, 26992 events. 13025/26992 cut-off events. For 136981/151041 co-relation queries the response was YES. Maximal size of possible extension queue 2306. Compared 300667 event pairs, 357 based on Foata normal form. 1625/27492 useless extension candidates. Maximal degree in co-relation 110917. Up to 4108 conditions per place. [2022-07-22 21:22:12,698 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 52 selfloop transitions, 43 changer transitions 133/322 dead transitions. [2022-07-22 21:22:12,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 322 transitions, 2867 flow [2022-07-22 21:22:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 21:22:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-22 21:22:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2225 transitions. [2022-07-22 21:22:12,704 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2022-07-22 21:22:12,704 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2225 transitions. [2022-07-22 21:22:12,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2225 transitions. [2022-07-22 21:22:12,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:12,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2225 transitions. [2022-07-22 21:22:12,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 117.10526315789474) internal successors, (2225), 19 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:12,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 135.0) internal successors, (2700), 20 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:12,717 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 135.0) internal successors, (2700), 20 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:12,717 INFO L186 Difference]: Start difference. First operand has 195 places, 190 transitions, 1164 flow. Second operand 19 states and 2225 transitions. [2022-07-22 21:22:12,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 322 transitions, 2867 flow [2022-07-22 21:22:15,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 322 transitions, 2704 flow, removed 55 selfloop flow, removed 6 redundant places. [2022-07-22 21:22:15,059 INFO L242 Difference]: Finished difference. Result has 211 places, 160 transitions, 928 flow [2022-07-22 21:22:15,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=928, PETRI_PLACES=211, PETRI_TRANSITIONS=160} [2022-07-22 21:22:15,059 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 69 predicate places. [2022-07-22 21:22:15,060 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 160 transitions, 928 flow [2022-07-22 21:22:15,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:15,060 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:15,060 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:15,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:22:15,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:22:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2059854829, now seen corresponding path program 1 times [2022-07-22 21:22:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675456225] [2022-07-22 21:22:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:22:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675456225] [2022-07-22 21:22:15,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675456225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:15,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:15,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:22:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690947762] [2022-07-22 21:22:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:15,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:22:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:22:15,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:22:15,187 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-07-22 21:22:15,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 160 transitions, 928 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:15,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:15,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-07-22 21:22:15,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:15,567 INFO L129 PetriNetUnfolder]: 634/2694 cut-off events. [2022-07-22 21:22:15,567 INFO L130 PetriNetUnfolder]: For 8760/9032 co-relation queries the response was YES. [2022-07-22 21:22:15,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9691 conditions, 2694 events. 634/2694 cut-off events. For 8760/9032 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 28886 event pairs, 10 based on Foata normal form. 1/2546 useless extension candidates. Maximal degree in co-relation 9622. Up to 352 conditions per place. [2022-07-22 21:22:15,590 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 19 selfloop transitions, 1 changer transitions 21/175 dead transitions. [2022-07-22 21:22:15,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 175 transitions, 1077 flow [2022-07-22 21:22:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:22:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:22:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2022-07-22 21:22:15,592 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2022-07-22 21:22:15,592 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2022-07-22 21:22:15,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2022-07-22 21:22:15,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:15,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2022-07-22 21:22:15,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:15,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:15,596 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:15,596 INFO L186 Difference]: Start difference. First operand has 211 places, 160 transitions, 928 flow. Second operand 7 states and 812 transitions. [2022-07-22 21:22:15,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 175 transitions, 1077 flow [2022-07-22 21:22:15,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 175 transitions, 828 flow, removed 58 selfloop flow, removed 32 redundant places. [2022-07-22 21:22:15,694 INFO L242 Difference]: Finished difference. Result has 180 places, 153 transitions, 662 flow [2022-07-22 21:22:15,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=662, PETRI_PLACES=180, PETRI_TRANSITIONS=153} [2022-07-22 21:22:15,695 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 38 predicate places. [2022-07-22 21:22:15,695 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 153 transitions, 662 flow [2022-07-22 21:22:15,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:15,696 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:15,696 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:22:15,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:22:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash 433245125, now seen corresponding path program 2 times [2022-07-22 21:22:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:15,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614445244] [2022-07-22 21:22:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:22:16,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:16,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614445244] [2022-07-22 21:22:16,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614445244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:16,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:16,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 21:22:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95932343] [2022-07-22 21:22:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:16,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 21:22:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 21:22:16,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-22 21:22:16,020 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2022-07-22 21:22:16,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 153 transitions, 662 flow. Second operand has 12 states, 12 states have (on average 108.91666666666667) internal successors, (1307), 12 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:16,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:16,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2022-07-22 21:22:16,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:16,333 INFO L129 PetriNetUnfolder]: 358/1495 cut-off events. [2022-07-22 21:22:16,333 INFO L130 PetriNetUnfolder]: For 2100/2145 co-relation queries the response was YES. [2022-07-22 21:22:16,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1495 events. 358/1495 cut-off events. For 2100/2145 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 14138 event pairs, 4 based on Foata normal form. 1/1409 useless extension candidates. Maximal degree in co-relation 3982. Up to 182 conditions per place. [2022-07-22 21:22:16,343 INFO L132 encePairwiseOnDemand]: 123/135 looper letters, 16 selfloop transitions, 8 changer transitions 34/159 dead transitions. [2022-07-22 21:22:16,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 159 transitions, 744 flow [2022-07-22 21:22:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:22:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:22:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1421 transitions. [2022-07-22 21:22:16,346 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8096866096866097 [2022-07-22 21:22:16,347 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1421 transitions. [2022-07-22 21:22:16,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1421 transitions. [2022-07-22 21:22:16,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:16,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1421 transitions. [2022-07-22 21:22:16,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 109.3076923076923) internal successors, (1421), 13 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:16,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:16,354 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:16,354 INFO L186 Difference]: Start difference. First operand has 180 places, 153 transitions, 662 flow. Second operand 13 states and 1421 transitions. [2022-07-22 21:22:16,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 159 transitions, 744 flow [2022-07-22 21:22:16,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 159 transitions, 707 flow, removed 11 selfloop flow, removed 10 redundant places. [2022-07-22 21:22:16,379 INFO L242 Difference]: Finished difference. Result has 183 places, 125 transitions, 436 flow [2022-07-22 21:22:16,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=436, PETRI_PLACES=183, PETRI_TRANSITIONS=125} [2022-07-22 21:22:16,380 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 41 predicate places. [2022-07-22 21:22:16,380 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 125 transitions, 436 flow [2022-07-22 21:22:16,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.91666666666667) internal successors, (1307), 12 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:16,381 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:16,381 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:22:16,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:22:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1992071005, now seen corresponding path program 3 times [2022-07-22 21:22:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:16,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319250691] [2022-07-22 21:22:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:22:16,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:22:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:22:16,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:22:16,546 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:22:16,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-22 21:22:16,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-22 21:22:16,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-22 21:22:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-22 21:22:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-22 21:22:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-22 21:22:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-22 21:22:16,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 21:22:16,549 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:16,555 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:22:16,555 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:22:16,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:22:16 BasicIcfg [2022-07-22 21:22:16,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:22:16,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:22:16,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:22:16,792 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:22:16,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:21:47" (3/4) ... [2022-07-22 21:22:16,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:22:16,944 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:22:16,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:22:16,945 INFO L158 Benchmark]: Toolchain (without parser) took 30793.35ms. Allocated memory was 107.0MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 71.9MB in the beginning and 6.0GB in the end (delta: -6.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-07-22 21:22:16,945 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory was 32.3MB in the beginning and 32.2MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:22:16,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.47ms. Allocated memory is still 107.0MB. Free memory was 71.7MB in the beginning and 66.8MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 21:22:16,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.52ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 64.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 21:22:16,946 INFO L158 Benchmark]: Boogie Preprocessor took 37.93ms. Allocated memory is still 107.0MB. Free memory was 64.0MB in the beginning and 61.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:22:16,946 INFO L158 Benchmark]: RCFGBuilder took 1134.21ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 61.5MB in the beginning and 84.3MB in the end (delta: -22.9MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2022-07-22 21:22:16,947 INFO L158 Benchmark]: TraceAbstraction took 28836.58ms. Allocated memory was 132.1MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 83.3MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-22 21:22:16,947 INFO L158 Benchmark]: Witness Printer took 152.27ms. Allocated memory is still 7.6GB. Free memory was 6.1GB in the beginning and 6.0GB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-07-22 21:22:16,950 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.19ms. Allocated memory is still 75.5MB. Free memory was 32.3MB in the beginning and 32.2MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.47ms. Allocated memory is still 107.0MB. Free memory was 71.7MB in the beginning and 66.8MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.52ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 64.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.93ms. Allocated memory is still 107.0MB. Free memory was 64.0MB in the beginning and 61.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1134.21ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 61.5MB in the beginning and 84.3MB in the end (delta: -22.9MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28836.58ms. Allocated memory was 132.1MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 83.3MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 152.27ms. Allocated memory is still 7.6GB. Free memory was 6.1GB in the beginning and 6.0GB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t469; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-3, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t470; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-2, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t471; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t472; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L827] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 865]: 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: 869]: 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: 867]: 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, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 791 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 696 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1325 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1663 IncrementalHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 137 mSDtfsCounter, 1663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=9, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1231 NumberOfCodeBlocks, 1231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1115 ConstructedInterpolants, 0 QuantifiedInterpolants, 4199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 21:22:16,989 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