./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/safe012_pso.oepc_pso.opt_rmo.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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:09:24,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:09:24,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:09:24,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:09:24,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:09:24,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:09:24,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:09:24,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:09:24,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:09:24,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:09:24,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:09:24,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:09:24,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:09:24,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:09:24,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:09:24,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:09:24,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:09:24,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:09:24,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:09:24,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:09:24,763 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:09:24,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:09:24,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:09:24,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:09:24,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:09:24,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:09:24,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:09:24,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:09:24,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:09:24,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:09:24,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:09:24,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:09:24,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:09:24,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:09:24,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:09:24,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:09:24,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:09:24,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:09:24,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:09:24,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:09:24,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:09:24,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:09:24,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:09:24,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:09:24,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:09:24,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:09:24,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:09:24,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:09:24,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:09:24,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:09:24,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:09:24,799 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:09:24,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:09:24,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:09:24,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:09:24,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:09:24,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:09:24,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:09:24,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:09:24,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:09:24,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:09:24,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:09:24,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:09:24,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:09:24,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:09:24,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:09:24,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:09:24,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:24,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:09:24,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:09:24,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:09:24,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:09:24,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:09:24,803 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:09:24,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:09:24,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:09:24,804 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2022-07-12 10:09:25,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:09:25,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:09:25,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:09:25,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:09:25,024 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:09:25,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-07-12 10:09:25,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b64e092/7795227ed6cb4741ad9cb4f0205c7cd2/FLAGb3c510b82 [2022-07-12 10:09:25,488 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:09:25,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-07-12 10:09:25,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b64e092/7795227ed6cb4741ad9cb4f0205c7cd2/FLAGb3c510b82 [2022-07-12 10:09:25,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b64e092/7795227ed6cb4741ad9cb4f0205c7cd2 [2022-07-12 10:09:25,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:09:25,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:09:25,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:25,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:09:25,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:09:25,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:25,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1e4592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25, skipping insertion in model container [2022-07-12 10:09:25,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:25,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:09:25,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:09:25,739 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-07-12 10:09:25,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:25,899 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:09:25,909 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-07-12 10:09:25,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:25,986 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:09:25,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25 WrapperNode [2022-07-12 10:09:25,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:25,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:25,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:09:25,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:09:25,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,044 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-07-12 10:09:26,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:26,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:09:26,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:09:26,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:09:26,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:09:26,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:09:26,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:09:26,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:09:26,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (1/1) ... [2022-07-12 10:09:26,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:26,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:09:26,118 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-12 10:09:26,146 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-12 10:09:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:09:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:09:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:09:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:09:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:09:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:09:26,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:09:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:09:26,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:09:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:09:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:09:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:09:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:09:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:09:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:09:26,165 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:09:26,263 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:09:26,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:09:26,674 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:09:26,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:09:26,875 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:09:26,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:26 BoogieIcfgContainer [2022-07-12 10:09:26,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:09:26,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:09:26,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:09:26,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:09:26,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:09:25" (1/3) ... [2022-07-12 10:09:26,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c0cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:26, skipping insertion in model container [2022-07-12 10:09:26,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:25" (2/3) ... [2022-07-12 10:09:26,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c0cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:26, skipping insertion in model container [2022-07-12 10:09:26,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:26" (3/3) ... [2022-07-12 10:09:26,884 INFO L111 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2022-07-12 10:09:26,888 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:09:26,894 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:09:26,894 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:09:26,894 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:09:26,935 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:09:26,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-07-12 10:09:27,002 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2022-07-12 10:09:27,003 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:27,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-07-12 10:09:27,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-07-12 10:09:27,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-07-12 10:09:27,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:09:27,022 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@6a10b45c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1efaf1e8 [2022-07-12 10:09:27,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:09:27,037 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-07-12 10:09:27,037 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:27,037 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:27,038 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] [2022-07-12 10:09:27,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -955412974, now seen corresponding path program 1 times [2022-07-12 10:09:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:27,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493599264] [2022-07-12 10:09:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:27,276 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-12 10:09:27,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:27,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493599264] [2022-07-12 10:09:27,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493599264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:27,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:27,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:09:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684295436] [2022-07-12 10:09:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:27,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:09:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:09:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:09:27,312 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 115 [2022-07-12 10:09:27,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-12 10:09:27,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:27,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 115 [2022-07-12 10:09:27,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:27,422 INFO L129 PetriNetUnfolder]: 37/223 cut-off events. [2022-07-12 10:09:27,422 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:09:27,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 223 events. 37/223 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 694 event pairs, 7 based on Foata normal form. 11/218 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2022-07-12 10:09:27,427 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 11 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-07-12 10:09:27,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 262 flow [2022-07-12 10:09:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:09:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:09:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-07-12 10:09:27,442 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2022-07-12 10:09:27,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-07-12 10:09:27,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-07-12 10:09:27,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:27,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-07-12 10:09:27,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-12 10:09:27,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-12 10:09:27,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-12 10:09:27,459 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 324 transitions. [2022-07-12 10:09:27,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 262 flow [2022-07-12 10:09:27,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 112 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:09:27,467 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-07-12 10:09:27,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-07-12 10:09:27,471 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-07-12 10:09:27,472 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-07-12 10:09:27,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-12 10:09:27,473 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:27,473 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:27,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:09:27,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1601349167, now seen corresponding path program 1 times [2022-07-12 10:09:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:27,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097216536] [2022-07-12 10:09:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:27,673 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-12 10:09:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097216536] [2022-07-12 10:09:27,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097216536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:27,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:27,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790481539] [2022-07-12 10:09:27,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:27,681 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-07-12 10:09:27,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 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-12 10:09:27,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:27,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-07-12 10:09:27,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:28,041 INFO L129 PetriNetUnfolder]: 546/1632 cut-off events. [2022-07-12 10:09:28,041 INFO L130 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-07-12 10:09:28,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 1632 events. 546/1632 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11455 event pairs, 273 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 2568. Up to 429 conditions per place. [2022-07-12 10:09:28,047 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 24 selfloop transitions, 2 changer transitions 51/154 dead transitions. [2022-07-12 10:09:28,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 154 transitions, 468 flow [2022-07-12 10:09:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 887 transitions. [2022-07-12 10:09:28,050 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8570048309178744 [2022-07-12 10:09:28,050 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 887 transitions. [2022-07-12 10:09:28,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 887 transitions. [2022-07-12 10:09:28,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:28,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 887 transitions. [2022-07-12 10:09:28,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.55555555555556) internal successors, (887), 9 states have internal predecessors, (887), 0 states have call successors, (0), 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-12 10:09:28,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 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-12 10:09:28,055 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 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-12 10:09:28,055 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 887 transitions. [2022-07-12 10:09:28,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 154 transitions, 468 flow [2022-07-12 10:09:28,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 154 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:09:28,058 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2022-07-12 10:09:28,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-07-12 10:09:28,059 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-07-12 10:09:28,059 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2022-07-12 10:09:28,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 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-12 10:09:28,060 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:28,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] [2022-07-12 10:09:28,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:09:28,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1242640656, now seen corresponding path program 1 times [2022-07-12 10:09:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:28,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682139522] [2022-07-12 10:09:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:28,155 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-12 10:09:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:28,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682139522] [2022-07-12 10:09:28,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682139522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:28,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:28,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477410394] [2022-07-12 10:09:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:28,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:28,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:28,159 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-07-12 10:09:28,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:28,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-07-12 10:09:28,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:28,677 INFO L129 PetriNetUnfolder]: 599/1335 cut-off events. [2022-07-12 10:09:28,678 INFO L130 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-07-12 10:09:28,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 1335 events. 599/1335 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8100 event pairs, 67 based on Foata normal form. 33/1321 useless extension candidates. Maximal degree in co-relation 2599. Up to 306 conditions per place. [2022-07-12 10:09:28,685 INFO L132 encePairwiseOnDemand]: 103/115 looper letters, 35 selfloop transitions, 10 changer transitions 68/188 dead transitions. [2022-07-12 10:09:28,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 188 transitions, 688 flow [2022-07-12 10:09:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:09:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:09:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1630 transitions. [2022-07-12 10:09:28,688 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8337595907928389 [2022-07-12 10:09:28,688 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1630 transitions. [2022-07-12 10:09:28,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1630 transitions. [2022-07-12 10:09:28,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:28,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1630 transitions. [2022-07-12 10:09:28,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 95.88235294117646) internal successors, (1630), 17 states have internal predecessors, (1630), 0 states have call successors, (0), 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-12 10:09:28,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 states have internal predecessors, (2070), 0 states have call successors, (0), 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-12 10:09:28,697 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 states have internal predecessors, (2070), 0 states have call successors, (0), 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-12 10:09:28,697 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 17 states and 1630 transitions. [2022-07-12 10:09:28,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 188 transitions, 688 flow [2022-07-12 10:09:28,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 188 transitions, 624 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-07-12 10:09:28,708 INFO L242 Difference]: Finished difference. Result has 135 places, 101 transitions, 302 flow [2022-07-12 10:09:28,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=302, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2022-07-12 10:09:28,710 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 15 predicate places. [2022-07-12 10:09:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 302 flow [2022-07-12 10:09:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,710 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:28,711 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:28,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:09:28,711 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 674298575, now seen corresponding path program 1 times [2022-07-12 10:09:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:28,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460580099] [2022-07-12 10:09:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:28,848 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-12 10:09:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460580099] [2022-07-12 10:09:28,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460580099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:28,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:28,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144331729] [2022-07-12 10:09:28,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:28,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:28,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:28,853 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-07-12 10:09:28,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 302 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 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-12 10:09:28,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:28,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-07-12 10:09:28,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,163 INFO L129 PetriNetUnfolder]: 442/983 cut-off events. [2022-07-12 10:09:29,163 INFO L130 PetriNetUnfolder]: For 3651/3651 co-relation queries the response was YES. [2022-07-12 10:09:29,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 983 events. 442/983 cut-off events. For 3651/3651 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5400 event pairs, 88 based on Foata normal form. 21/947 useless extension candidates. Maximal degree in co-relation 3163. Up to 225 conditions per place. [2022-07-12 10:09:29,169 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 24 selfloop transitions, 4 changer transitions 43/146 dead transitions. [2022-07-12 10:09:29,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 146 transitions, 742 flow [2022-07-12 10:09:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2022-07-12 10:09:29,171 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8330434782608696 [2022-07-12 10:09:29,171 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 958 transitions. [2022-07-12 10:09:29,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 958 transitions. [2022-07-12 10:09:29,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 958 transitions. [2022-07-12 10:09:29,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.8) internal successors, (958), 10 states have internal predecessors, (958), 0 states have call successors, (0), 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-12 10:09:29,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-12 10:09:29,175 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-12 10:09:29,175 INFO L186 Difference]: Start difference. First operand has 135 places, 101 transitions, 302 flow. Second operand 10 states and 958 transitions. [2022-07-12 10:09:29,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 146 transitions, 742 flow [2022-07-12 10:09:29,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 146 transitions, 630 flow, removed 52 selfloop flow, removed 10 redundant places. [2022-07-12 10:09:29,186 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 270 flow [2022-07-12 10:09:29,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-07-12 10:09:29,187 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-07-12 10:09:29,187 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 270 flow [2022-07-12 10:09:29,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 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-12 10:09:29,195 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,195 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:29,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:09:29,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 613653508, now seen corresponding path program 1 times [2022-07-12 10:09:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68259503] [2022-07-12 10:09:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:29,322 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-12 10:09:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:29,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68259503] [2022-07-12 10:09:29,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68259503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:29,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:29,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672376812] [2022-07-12 10:09:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:29,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:29,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:29,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:29,324 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-07-12 10:09:29,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 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-12 10:09:29,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:29,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-07-12 10:09:29,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,588 INFO L129 PetriNetUnfolder]: 282/703 cut-off events. [2022-07-12 10:09:29,588 INFO L130 PetriNetUnfolder]: For 1406/1406 co-relation queries the response was YES. [2022-07-12 10:09:29,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 703 events. 282/703 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3513 event pairs, 90 based on Foata normal form. 16/682 useless extension candidates. Maximal degree in co-relation 1940. Up to 158 conditions per place. [2022-07-12 10:09:29,591 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 19 selfloop transitions, 6 changer transitions 36/136 dead transitions. [2022-07-12 10:09:29,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 136 transitions, 614 flow [2022-07-12 10:09:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1042 transitions. [2022-07-12 10:09:29,594 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8237154150197629 [2022-07-12 10:09:29,594 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1042 transitions. [2022-07-12 10:09:29,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1042 transitions. [2022-07-12 10:09:29,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1042 transitions. [2022-07-12 10:09:29,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.72727272727273) internal successors, (1042), 11 states have internal predecessors, (1042), 0 states have call successors, (0), 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-12 10:09:29,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-12 10:09:29,598 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-12 10:09:29,598 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 270 flow. Second operand 11 states and 1042 transitions. [2022-07-12 10:09:29,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 136 transitions, 614 flow [2022-07-12 10:09:29,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 541 flow, removed 23 selfloop flow, removed 14 redundant places. [2022-07-12 10:09:29,603 INFO L242 Difference]: Finished difference. Result has 128 places, 96 transitions, 266 flow [2022-07-12 10:09:29,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=266, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-07-12 10:09:29,603 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2022-07-12 10:09:29,604 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 266 flow [2022-07-12 10:09:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 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-12 10:09:29,604 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,604 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:29,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:09:29,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -994709294, now seen corresponding path program 1 times [2022-07-12 10:09:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257122178] [2022-07-12 10:09:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:29,664 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-12 10:09:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:29,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257122178] [2022-07-12 10:09:29,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257122178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:29,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:29,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501637153] [2022-07-12 10:09:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:29,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:29,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:29,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:29,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:29,666 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-07-12 10:09:29,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 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-12 10:09:29,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:29,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-07-12 10:09:29,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,942 INFO L129 PetriNetUnfolder]: 517/1222 cut-off events. [2022-07-12 10:09:29,942 INFO L130 PetriNetUnfolder]: For 1979/1979 co-relation queries the response was YES. [2022-07-12 10:09:29,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1222 events. 517/1222 cut-off events. For 1979/1979 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7303 event pairs, 22 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 2837. Up to 315 conditions per place. [2022-07-12 10:09:29,949 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 25 selfloop transitions, 6 changer transitions 42/150 dead transitions. [2022-07-12 10:09:29,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 150 transitions, 592 flow [2022-07-12 10:09:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2022-07-12 10:09:29,951 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8652173913043478 [2022-07-12 10:09:29,951 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 995 transitions. [2022-07-12 10:09:29,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 995 transitions. [2022-07-12 10:09:29,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 995 transitions. [2022-07-12 10:09:29,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.5) internal successors, (995), 10 states have internal predecessors, (995), 0 states have call successors, (0), 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-12 10:09:29,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-12 10:09:29,956 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-12 10:09:29,956 INFO L186 Difference]: Start difference. First operand has 128 places, 96 transitions, 266 flow. Second operand 10 states and 995 transitions. [2022-07-12 10:09:29,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 150 transitions, 592 flow [2022-07-12 10:09:29,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 562 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-07-12 10:09:29,960 INFO L242 Difference]: Finished difference. Result has 126 places, 98 transitions, 290 flow [2022-07-12 10:09:29,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=290, PETRI_PLACES=126, PETRI_TRANSITIONS=98} [2022-07-12 10:09:29,962 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2022-07-12 10:09:29,963 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 98 transitions, 290 flow [2022-07-12 10:09:29,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 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-12 10:09:29,963 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,963 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] [2022-07-12 10:09:29,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:09:29,964 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 224136803, now seen corresponding path program 1 times [2022-07-12 10:09:29,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134823986] [2022-07-12 10:09:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:30,078 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-12 10:09:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:30,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134823986] [2022-07-12 10:09:30,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134823986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:30,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:30,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:30,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904923870] [2022-07-12 10:09:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:30,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:30,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:30,085 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-07-12 10:09:30,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 98 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 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-12 10:09:30,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:30,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-07-12 10:09:30,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:30,279 INFO L129 PetriNetUnfolder]: 184/568 cut-off events. [2022-07-12 10:09:30,279 INFO L130 PetriNetUnfolder]: For 1090/1090 co-relation queries the response was YES. [2022-07-12 10:09:30,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 568 events. 184/568 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2710 event pairs, 12 based on Foata normal form. 19/579 useless extension candidates. Maximal degree in co-relation 1574. Up to 133 conditions per place. [2022-07-12 10:09:30,283 INFO L132 encePairwiseOnDemand]: 106/115 looper letters, 28 selfloop transitions, 9 changer transitions 31/145 dead transitions. [2022-07-12 10:09:30,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 145 transitions, 719 flow [2022-07-12 10:09:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions. [2022-07-12 10:09:30,286 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8608695652173913 [2022-07-12 10:09:30,286 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 990 transitions. [2022-07-12 10:09:30,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 990 transitions. [2022-07-12 10:09:30,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:30,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 990 transitions. [2022-07-12 10:09:30,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 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-12 10:09:30,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-12 10:09:30,290 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-12 10:09:30,290 INFO L186 Difference]: Start difference. First operand has 126 places, 98 transitions, 290 flow. Second operand 10 states and 990 transitions. [2022-07-12 10:09:30,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 145 transitions, 719 flow [2022-07-12 10:09:30,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 145 transitions, 695 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-12 10:09:30,293 INFO L242 Difference]: Finished difference. Result has 130 places, 101 transitions, 358 flow [2022-07-12 10:09:30,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=358, PETRI_PLACES=130, PETRI_TRANSITIONS=101} [2022-07-12 10:09:30,294 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-07-12 10:09:30,294 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 101 transitions, 358 flow [2022-07-12 10:09:30,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 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-12 10:09:30,296 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:30,296 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] [2022-07-12 10:09:30,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:09:30,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:30,297 INFO L85 PathProgramCache]: Analyzing trace with hash 486008004, now seen corresponding path program 1 times [2022-07-12 10:09:30,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:30,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352233181] [2022-07-12 10:09:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:30,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:30,410 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-12 10:09:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:30,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352233181] [2022-07-12 10:09:30,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352233181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:30,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:30,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803086917] [2022-07-12 10:09:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:30,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:30,415 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-07-12 10:09:30,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 101 transitions, 358 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 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-12 10:09:30,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:30,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-07-12 10:09:30,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:30,565 INFO L129 PetriNetUnfolder]: 54/243 cut-off events. [2022-07-12 10:09:30,565 INFO L130 PetriNetUnfolder]: For 630/634 co-relation queries the response was YES. [2022-07-12 10:09:30,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 243 events. 54/243 cut-off events. For 630/634 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 738 event pairs, 7 based on Foata normal form. 7/245 useless extension candidates. Maximal degree in co-relation 694. Up to 49 conditions per place. [2022-07-12 10:09:30,566 INFO L132 encePairwiseOnDemand]: 106/115 looper letters, 19 selfloop transitions, 12 changer transitions 19/127 dead transitions. [2022-07-12 10:09:30,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 652 flow [2022-07-12 10:09:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1064 transitions. [2022-07-12 10:09:30,569 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.841106719367589 [2022-07-12 10:09:30,569 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1064 transitions. [2022-07-12 10:09:30,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1064 transitions. [2022-07-12 10:09:30,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:30,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1064 transitions. [2022-07-12 10:09:30,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.72727272727273) internal successors, (1064), 11 states have internal predecessors, (1064), 0 states have call successors, (0), 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-12 10:09:30,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-12 10:09:30,574 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-12 10:09:30,574 INFO L186 Difference]: Start difference. First operand has 130 places, 101 transitions, 358 flow. Second operand 11 states and 1064 transitions. [2022-07-12 10:09:30,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 652 flow [2022-07-12 10:09:30,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 487 flow, removed 69 selfloop flow, removed 15 redundant places. [2022-07-12 10:09:30,577 INFO L242 Difference]: Finished difference. Result has 127 places, 101 transitions, 318 flow [2022-07-12 10:09:30,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=318, PETRI_PLACES=127, PETRI_TRANSITIONS=101} [2022-07-12 10:09:30,579 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 7 predicate places. [2022-07-12 10:09:30,579 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 101 transitions, 318 flow [2022-07-12 10:09:30,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 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-12 10:09:30,580 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:30,580 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-12 10:09:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:09:30,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1551254147, now seen corresponding path program 1 times [2022-07-12 10:09:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127177050] [2022-07-12 10:09:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:30,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:09:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:30,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:09:30,669 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:09:30,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:09:30,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:09:30,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:09:30,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:09:30,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:09:30,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:09:30,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:09:30,672 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:30,677 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:09:30,677 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:09:30,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:09:30 BasicIcfg [2022-07-12 10:09:30,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:09:30,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:09:30,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:09:30,768 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:09:30,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:26" (3/4) ... [2022-07-12 10:09:30,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:09:30,839 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:09:30,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:09:30,839 INFO L158 Benchmark]: Toolchain (without parser) took 5318.44ms. Allocated memory was 102.8MB in the beginning and 207.6MB in the end (delta: 104.9MB). Free memory was 64.8MB in the beginning and 64.4MB in the end (delta: 413.4kB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,840 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:09:30,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.86ms. Allocated memory is still 102.8MB. Free memory was 64.6MB in the beginning and 65.5MB in the end (delta: -897.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.31ms. Allocated memory is still 102.8MB. Free memory was 65.5MB in the beginning and 63.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,840 INFO L158 Benchmark]: Boogie Preprocessor took 42.30ms. Allocated memory is still 102.8MB. Free memory was 63.0MB in the beginning and 60.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,840 INFO L158 Benchmark]: RCFGBuilder took 788.21ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 60.6MB in the beginning and 102.3MB in the end (delta: -41.7MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,840 INFO L158 Benchmark]: TraceAbstraction took 3887.90ms. Allocated memory was 130.0MB in the beginning and 207.6MB in the end (delta: 77.6MB). Free memory was 102.3MB in the beginning and 96.9MB in the end (delta: 5.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,841 INFO L158 Benchmark]: Witness Printer took 71.23ms. Allocated memory is still 207.6MB. Free memory was 96.9MB in the beginning and 64.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,842 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.29ms. Allocated memory is still 102.8MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.86ms. Allocated memory is still 102.8MB. Free memory was 64.6MB in the beginning and 65.5MB in the end (delta: -897.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.31ms. Allocated memory is still 102.8MB. Free memory was 65.5MB in the beginning and 63.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.30ms. Allocated memory is still 102.8MB. Free memory was 63.0MB in the beginning and 60.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 788.21ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 60.6MB in the beginning and 102.3MB in the end (delta: -41.7MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3887.90ms. Allocated memory was 130.0MB in the beginning and 207.6MB in the end (delta: 77.6MB). Free memory was 102.3MB in the beginning and 96.9MB in the end (delta: 5.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 71.23ms. Allocated memory is still 207.6MB. Free memory was 96.9MB in the beginning and 64.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2055; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-2, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2056; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=-1, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2057; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 832]: 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: 836]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 667 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 867 IncrementalHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 73 mSDtfsCounter, 867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=7, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 2646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12 10:09:30,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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