./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc --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 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:53,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:53,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:53,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:53,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:53,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:53,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:53,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:53,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:53,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:53,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:53,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:53,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:53,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:53,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:53,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:53,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:53,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:53,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:53,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:53,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:53,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:53,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:53,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:53,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:53,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:53,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:53,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:53,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:53,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:53,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:53,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:53,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:53,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:53,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:53,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:53,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:53,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:53,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:53,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:53,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:53,634 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:53:53,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:53,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:53,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:53,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:53,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:53,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:53,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:53,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:53,677 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:53,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:53,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:53,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:53,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:53,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:53,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:53,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:53,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:53,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:53,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:53,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:53,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:53,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:53,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:53,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:53,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:53,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:53,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:53,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:53,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:53,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:53,685 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:53,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:53,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:53,686 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc 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 -> 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 [2022-11-02 20:53:53,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:53,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:53,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:53,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:53,991 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:53,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix042.opt.i [2022-11-02 20:53:54,070 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/data/56e3bd0bd/7b89c624cfa74c54aeecb58bf37b5d40/FLAG68c4e8939 [2022-11-02 20:53:54,695 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:54,695 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/sv-benchmarks/c/pthread-wmm/mix042.opt.i [2022-11-02 20:53:54,710 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/data/56e3bd0bd/7b89c624cfa74c54aeecb58bf37b5d40/FLAG68c4e8939 [2022-11-02 20:53:54,974 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/data/56e3bd0bd/7b89c624cfa74c54aeecb58bf37b5d40 [2022-11-02 20:53:54,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:54,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:54,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:54,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:54,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:54,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:54" (1/1) ... [2022-11-02 20:53:54,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2f8da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:54, skipping insertion in model container [2022-11-02 20:53:54,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:54" (1/1) ... [2022-11-02 20:53:55,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:55,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:55,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/sv-benchmarks/c/pthread-wmm/mix042.opt.i[944,957] [2022-11-02 20:53:55,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:55,638 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:55,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/sv-benchmarks/c/pthread-wmm/mix042.opt.i[944,957] [2022-11-02 20:53:55,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:55,773 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:55,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55 WrapperNode [2022-11-02 20:53:55,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:55,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:55,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:55,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:55,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,871 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 283 [2022-11-02 20:53:55,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:55,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:55,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:55,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:55,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,936 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:55,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:55,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:55,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:55,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:55,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:55,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:55,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:56,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:53:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:53:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:53:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:53:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:53:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:53:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:53:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:53:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:56,046 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:53:56,205 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:56,221 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:56,996 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:57,366 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:57,367 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:53:57,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:57 BoogieIcfgContainer [2022-11-02 20:53:57,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:57,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:57,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:57,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:57,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:54" (1/3) ... [2022-11-02 20:53:57,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7960e7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:57, skipping insertion in model container [2022-11-02 20:53:57,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (2/3) ... [2022-11-02 20:53:57,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7960e7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:57, skipping insertion in model container [2022-11-02 20:53:57,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:57" (3/3) ... [2022-11-02 20:53:57,378 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2022-11-02 20:53:57,388 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:53:57,399 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:57,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:53:57,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:53:57,454 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:53:57,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-11-02 20:53:57,538 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-02 20:53:57,538 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:57,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-02 20:53:57,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2022-11-02 20:53:57,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2022-11-02 20:53:57,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:57,563 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2741d514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:57,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:53:57,580 INFO L130 PetriNetUnfolder]: 0/75 cut-off events. [2022-11-02 20:53:57,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:57,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:57,581 INFO L208 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] [2022-11-02 20:53:57,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:53:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2018288398, now seen corresponding path program 1 times [2022-11-02 20:53:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:57,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161546540] [2022-11-02 20:53:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:58,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161546540] [2022-11-02 20:53:58,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161546540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:58,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:58,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606705713] [2022-11-02 20:53:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:58,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:58,301 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 118 [2022-11-02 20:53:58,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-11-02 20:53:58,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:58,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 118 [2022-11-02 20:53:58,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:58,467 INFO L130 PetriNetUnfolder]: 17/195 cut-off events. [2022-11-02 20:53:58,467 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:53:58,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 195 events. 17/195 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 486 event pairs, 3 based on Foata normal form. 9/197 useless extension candidates. Maximal degree in co-relation 193. Up to 27 conditions per place. [2022-11-02 20:53:58,470 INFO L137 encePairwiseOnDemand]: 113/118 looper letters, 10 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-11-02 20:53:58,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 261 flow [2022-11-02 20:53:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2022-11-02 20:53:58,485 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9378531073446328 [2022-11-02 20:53:58,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2022-11-02 20:53:58,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2022-11-02 20:53:58,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:58,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2022-11-02 20:53:58,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-11-02 20:53:58,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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-11-02 20:53:58,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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-11-02 20:53:58,504 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 239 flow. Second operand 3 states and 332 transitions. [2022-11-02 20:53:58,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 261 flow [2022-11-02 20:53:58,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 114 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:53:58,513 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 232 flow [2022-11-02 20:53:58,515 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2022-11-02 20:53:58,519 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-02 20:53:58,519 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 232 flow [2022-11-02 20:53:58,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-11-02 20:53:58,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:58,520 INFO L208 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] [2022-11-02 20:53:58,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:58,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:53:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -742004216, now seen corresponding path program 1 times [2022-11-02 20:53:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:58,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841783620] [2022-11-02 20:53:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:59,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841783620] [2022-11-02 20:53:59,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841783620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:59,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:59,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917150453] [2022-11-02 20:53:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:59,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:59,085 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 118 [2022-11-02 20:53:59,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 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-11-02 20:53:59,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:59,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 118 [2022-11-02 20:53:59,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:59,527 INFO L130 PetriNetUnfolder]: 84/414 cut-off events. [2022-11-02 20:53:59,528 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:53:59,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 414 events. 84/414 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2006 event pairs, 18 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 555. Up to 65 conditions per place. [2022-11-02 20:53:59,535 INFO L137 encePairwiseOnDemand]: 112/118 looper letters, 15 selfloop transitions, 2 changer transitions 36/137 dead transitions. [2022-11-02 20:53:59,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 137 transitions, 374 flow [2022-11-02 20:53:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:53:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2022-11-02 20:53:59,543 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.871939736346516 [2022-11-02 20:53:59,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2022-11-02 20:53:59,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2022-11-02 20:53:59,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:59,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2022-11-02 20:53:59,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.88888888888889) internal successors, (926), 9 states have internal predecessors, (926), 0 states have call successors, (0), 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-11-02 20:53:59,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 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-11-02 20:53:59,554 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 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-11-02 20:53:59,555 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 232 flow. Second operand 9 states and 926 transitions. [2022-11-02 20:53:59,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 137 transitions, 374 flow [2022-11-02 20:53:59,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:59,561 INFO L231 Difference]: Finished difference. Result has 133 places, 99 transitions, 224 flow [2022-11-02 20:53:59,561 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=133, PETRI_TRANSITIONS=99} [2022-11-02 20:53:59,562 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 10 predicate places. [2022-11-02 20:53:59,563 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 99 transitions, 224 flow [2022-11-02 20:53:59,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 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-11-02 20:53:59,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:59,564 INFO L208 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-11-02 20:53:59,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:59,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:53:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 613859141, now seen corresponding path program 1 times [2022-11-02 20:53:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:59,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811307380] [2022-11-02 20:53:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:00,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:00,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811307380] [2022-11-02 20:54:00,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811307380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:00,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:00,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598474107] [2022-11-02 20:54:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:00,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:00,543 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 118 [2022-11-02 20:54:00,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 99 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 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-11-02 20:54:00,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:00,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 118 [2022-11-02 20:54:00,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:00,933 INFO L130 PetriNetUnfolder]: 66/276 cut-off events. [2022-11-02 20:54:00,933 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-02 20:54:00,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 276 events. 66/276 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1009 event pairs, 23 based on Foata normal form. 6/273 useless extension candidates. Maximal degree in co-relation 457. Up to 85 conditions per place. [2022-11-02 20:54:00,935 INFO L137 encePairwiseOnDemand]: 109/118 looper letters, 17 selfloop transitions, 5 changer transitions 22/126 dead transitions. [2022-11-02 20:54:00,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 386 flow [2022-11-02 20:54:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:54:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:54:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1102 transitions. [2022-11-02 20:54:00,939 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8489984591679507 [2022-11-02 20:54:00,939 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1102 transitions. [2022-11-02 20:54:00,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1102 transitions. [2022-11-02 20:54:00,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:00,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1102 transitions. [2022-11-02 20:54:00,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 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-11-02 20:54:00,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 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-11-02 20:54:00,947 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 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-11-02 20:54:00,947 INFO L175 Difference]: Start difference. First operand has 133 places, 99 transitions, 224 flow. Second operand 11 states and 1102 transitions. [2022-11-02 20:54:00,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 386 flow [2022-11-02 20:54:00,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 126 transitions, 354 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-02 20:54:00,952 INFO L231 Difference]: Finished difference. Result has 124 places, 101 transitions, 255 flow [2022-11-02 20:54:00,953 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=255, PETRI_PLACES=124, PETRI_TRANSITIONS=101} [2022-11-02 20:54:00,953 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 1 predicate places. [2022-11-02 20:54:00,954 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 255 flow [2022-11-02 20:54:00,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 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-11-02 20:54:00,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:00,955 INFO L208 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] [2022-11-02 20:54:00,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:00,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:54:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1275380348, now seen corresponding path program 1 times [2022-11-02 20:54:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791923741] [2022-11-02 20:54:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:01,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791923741] [2022-11-02 20:54:01,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791923741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:01,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:01,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:01,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952019662] [2022-11-02 20:54:01,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:01,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:01,392 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2022-11-02 20:54:01,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 101 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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-11-02 20:54:01,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:01,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2022-11-02 20:54:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:01,907 INFO L130 PetriNetUnfolder]: 538/1215 cut-off events. [2022-11-02 20:54:01,908 INFO L131 PetriNetUnfolder]: For 956/956 co-relation queries the response was YES. [2022-11-02 20:54:01,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2668 conditions, 1215 events. 538/1215 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7829 event pairs, 13 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 2604. Up to 365 conditions per place. [2022-11-02 20:54:01,920 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 34 selfloop transitions, 7 changer transitions 39/161 dead transitions. [2022-11-02 20:54:01,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 161 transitions, 616 flow [2022-11-02 20:54:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:54:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:54:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1024 transitions. [2022-11-02 20:54:01,948 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8677966101694915 [2022-11-02 20:54:01,948 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1024 transitions. [2022-11-02 20:54:01,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1024 transitions. [2022-11-02 20:54:01,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:01,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1024 transitions. [2022-11-02 20:54:01,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.4) internal successors, (1024), 10 states have internal predecessors, (1024), 0 states have call successors, (0), 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-11-02 20:54:01,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 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-11-02 20:54:01,955 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 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-11-02 20:54:01,955 INFO L175 Difference]: Start difference. First operand has 124 places, 101 transitions, 255 flow. Second operand 10 states and 1024 transitions. [2022-11-02 20:54:01,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 161 transitions, 616 flow [2022-11-02 20:54:01,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 161 transitions, 596 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-02 20:54:01,961 INFO L231 Difference]: Finished difference. Result has 127 places, 105 transitions, 304 flow [2022-11-02 20:54:01,962 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2022-11-02 20:54:01,963 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 4 predicate places. [2022-11-02 20:54:01,963 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 304 flow [2022-11-02 20:54:01,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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-11-02 20:54:01,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:01,964 INFO L208 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-11-02 20:54:01,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:54:01,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:54:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1137071077, now seen corresponding path program 1 times [2022-11-02 20:54:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057193867] [2022-11-02 20:54:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:02,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057193867] [2022-11-02 20:54:02,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057193867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:02,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:02,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843630072] [2022-11-02 20:54:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:02,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:54:02,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:02,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:54:02,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:02,346 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2022-11-02 20:54:02,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 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-11-02 20:54:02,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:02,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2022-11-02 20:54:02,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:02,794 INFO L130 PetriNetUnfolder]: 267/787 cut-off events. [2022-11-02 20:54:02,795 INFO L131 PetriNetUnfolder]: For 1265/1271 co-relation queries the response was YES. [2022-11-02 20:54:02,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 787 events. 267/787 cut-off events. For 1265/1271 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4820 event pairs, 11 based on Foata normal form. 21/806 useless extension candidates. Maximal degree in co-relation 2199. Up to 205 conditions per place. [2022-11-02 20:54:02,802 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 42 selfloop transitions, 18 changer transitions 24/165 dead transitions. [2022-11-02 20:54:02,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 165 transitions, 817 flow [2022-11-02 20:54:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:54:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:54:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1127 transitions. [2022-11-02 20:54:02,805 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8682588597842835 [2022-11-02 20:54:02,806 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1127 transitions. [2022-11-02 20:54:02,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1127 transitions. [2022-11-02 20:54:02,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:02,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1127 transitions. [2022-11-02 20:54:02,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.45454545454545) internal successors, (1127), 11 states have internal predecessors, (1127), 0 states have call successors, (0), 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-11-02 20:54:02,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 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-11-02 20:54:02,813 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 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-11-02 20:54:02,813 INFO L175 Difference]: Start difference. First operand has 127 places, 105 transitions, 304 flow. Second operand 11 states and 1127 transitions. [2022-11-02 20:54:02,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 165 transitions, 817 flow [2022-11-02 20:54:02,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 165 transitions, 801 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:02,821 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 481 flow [2022-11-02 20:54:02,821 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=481, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2022-11-02 20:54:02,822 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 12 predicate places. [2022-11-02 20:54:02,822 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 481 flow [2022-11-02 20:54:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 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-11-02 20:54:02,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:02,823 INFO L208 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-11-02 20:54:02,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:54:02,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:54:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1753781499, now seen corresponding path program 1 times [2022-11-02 20:54:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:02,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110281810] [2022-11-02 20:54:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:03,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:03,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110281810] [2022-11-02 20:54:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110281810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:03,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:03,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369722615] [2022-11-02 20:54:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:03,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:54:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:54:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:03,156 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 118 [2022-11-02 20:54:03,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 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-11-02 20:54:03,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:03,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 118 [2022-11-02 20:54:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:03,601 INFO L130 PetriNetUnfolder]: 178/951 cut-off events. [2022-11-02 20:54:03,601 INFO L131 PetriNetUnfolder]: For 1989/2140 co-relation queries the response was YES. [2022-11-02 20:54:03,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 951 events. 178/951 cut-off events. For 1989/2140 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7218 event pairs, 7 based on Foata normal form. 10/926 useless extension candidates. Maximal degree in co-relation 2700. Up to 242 conditions per place. [2022-11-02 20:54:03,612 INFO L137 encePairwiseOnDemand]: 112/118 looper letters, 37 selfloop transitions, 2 changer transitions 10/151 dead transitions. [2022-11-02 20:54:03,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 151 transitions, 713 flow [2022-11-02 20:54:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:54:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2022-11-02 20:54:03,615 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704600484261501 [2022-11-02 20:54:03,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2022-11-02 20:54:03,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2022-11-02 20:54:03,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:03,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2022-11-02 20:54:03,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 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-11-02 20:54:03,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 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-11-02 20:54:03,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 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-11-02 20:54:03,621 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 481 flow. Second operand 7 states and 719 transitions. [2022-11-02 20:54:03,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 151 transitions, 713 flow [2022-11-02 20:54:03,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 151 transitions, 659 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:03,639 INFO L231 Difference]: Finished difference. Result has 144 places, 121 transitions, 446 flow [2022-11-02 20:54:03,639 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=144, PETRI_TRANSITIONS=121} [2022-11-02 20:54:03,640 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 21 predicate places. [2022-11-02 20:54:03,640 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 121 transitions, 446 flow [2022-11-02 20:54:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 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-11-02 20:54:03,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:03,641 INFO L208 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-11-02 20:54:03,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:54:03,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:54:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1002205957, now seen corresponding path program 2 times [2022-11-02 20:54:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701143475] [2022-11-02 20:54:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:03,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:03,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701143475] [2022-11-02 20:54:03,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701143475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:03,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:03,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652733468] [2022-11-02 20:54:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:03,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:03,995 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2022-11-02 20:54:03,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 121 transitions, 446 flow. Second operand has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 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-11-02 20:54:03,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:03,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2022-11-02 20:54:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:04,566 INFO L130 PetriNetUnfolder]: 372/1146 cut-off events. [2022-11-02 20:54:04,567 INFO L131 PetriNetUnfolder]: For 2243/2282 co-relation queries the response was YES. [2022-11-02 20:54:04,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 1146 events. 372/1146 cut-off events. For 2243/2282 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8679 event pairs, 16 based on Foata normal form. 31/1155 useless extension candidates. Maximal degree in co-relation 3476. Up to 133 conditions per place. [2022-11-02 20:54:04,575 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 30 selfloop transitions, 22 changer transitions 32/165 dead transitions. [2022-11-02 20:54:04,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 165 transitions, 864 flow [2022-11-02 20:54:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:54:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:54:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1403 transitions. [2022-11-02 20:54:04,580 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8492736077481841 [2022-11-02 20:54:04,580 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1403 transitions. [2022-11-02 20:54:04,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1403 transitions. [2022-11-02 20:54:04,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:04,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1403 transitions. [2022-11-02 20:54:04,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 100.21428571428571) internal successors, (1403), 14 states have internal predecessors, (1403), 0 states have call successors, (0), 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-11-02 20:54:04,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 118.0) internal successors, (1770), 15 states have internal predecessors, (1770), 0 states have call successors, (0), 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-11-02 20:54:04,589 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 118.0) internal successors, (1770), 15 states have internal predecessors, (1770), 0 states have call successors, (0), 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-11-02 20:54:04,589 INFO L175 Difference]: Start difference. First operand has 144 places, 121 transitions, 446 flow. Second operand 14 states and 1403 transitions. [2022-11-02 20:54:04,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 165 transitions, 864 flow [2022-11-02 20:54:04,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 165 transitions, 775 flow, removed 43 selfloop flow, removed 8 redundant places. [2022-11-02 20:54:04,602 INFO L231 Difference]: Finished difference. Result has 153 places, 121 transitions, 487 flow [2022-11-02 20:54:04,603 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=487, PETRI_PLACES=153, PETRI_TRANSITIONS=121} [2022-11-02 20:54:04,603 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 30 predicate places. [2022-11-02 20:54:04,604 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 121 transitions, 487 flow [2022-11-02 20:54:04,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 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-11-02 20:54:04,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:04,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:04,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:54:04,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:54:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1435362178, now seen corresponding path program 1 times [2022-11-02 20:54:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:04,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805997509] [2022-11-02 20:54:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:04,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:04,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805997509] [2022-11-02 20:54:04,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805997509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:04,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:04,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078119841] [2022-11-02 20:54:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:04,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:54:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:04,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:54:04,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:04,935 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 118 [2022-11-02 20:54:04,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 121 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 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-11-02 20:54:04,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:04,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 118 [2022-11-02 20:54:04,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:05,280 INFO L130 PetriNetUnfolder]: 131/934 cut-off events. [2022-11-02 20:54:05,280 INFO L131 PetriNetUnfolder]: For 1854/1886 co-relation queries the response was YES. [2022-11-02 20:54:05,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 934 events. 131/934 cut-off events. For 1854/1886 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7931 event pairs, 10 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 2508. Up to 128 conditions per place. [2022-11-02 20:54:05,288 INFO L137 encePairwiseOnDemand]: 112/118 looper letters, 18 selfloop transitions, 1 changer transitions 13/135 dead transitions. [2022-11-02 20:54:05,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 135 transitions, 591 flow [2022-11-02 20:54:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:54:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2022-11-02 20:54:05,291 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.851089588377724 [2022-11-02 20:54:05,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2022-11-02 20:54:05,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2022-11-02 20:54:05,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:05,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2022-11-02 20:54:05,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 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-11-02 20:54:05,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 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-11-02 20:54:05,296 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 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-11-02 20:54:05,296 INFO L175 Difference]: Start difference. First operand has 153 places, 121 transitions, 487 flow. Second operand 7 states and 703 transitions. [2022-11-02 20:54:05,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 135 transitions, 591 flow [2022-11-02 20:54:05,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 135 transitions, 515 flow, removed 20 selfloop flow, removed 14 redundant places. [2022-11-02 20:54:05,320 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 426 flow [2022-11-02 20:54:05,320 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2022-11-02 20:54:05,321 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 23 predicate places. [2022-11-02 20:54:05,321 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 426 flow [2022-11-02 20:54:05,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 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-11-02 20:54:05,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:05,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:05,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:54:05,323 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:54:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2132755148, now seen corresponding path program 2 times [2022-11-02 20:54:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:05,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528760733] [2022-11-02 20:54:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:54:05,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:54:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:54:05,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:54:05,460 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:54:05,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 20:54:05,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 20:54:05,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 20:54:05,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-02 20:54:05,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-02 20:54:05,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:54:05,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:54:05,465 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:54:05,472 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:54:05,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:54:05,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:54:05 BasicIcfg [2022-11-02 20:54:05,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:54:05,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:54:05,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:54:05,620 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:54:05,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:57" (3/4) ... [2022-11-02 20:54:05,623 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:54:05,768 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:54:05,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:54:05,769 INFO L158 Benchmark]: Toolchain (without parser) took 10788.01ms. Allocated memory was 104.9MB in the beginning and 262.1MB in the end (delta: 157.3MB). Free memory was 61.8MB in the beginning and 113.0MB in the end (delta: -51.2MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,769 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:54:05,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 789.33ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 67.0MB in the end (delta: -5.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.96ms. Allocated memory is still 104.9MB. Free memory was 66.7MB in the beginning and 64.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,770 INFO L158 Benchmark]: Boogie Preprocessor took 66.77ms. Allocated memory is still 104.9MB. Free memory was 64.0MB in the beginning and 61.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,777 INFO L158 Benchmark]: RCFGBuilder took 1427.61ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 61.6MB in the beginning and 71.0MB in the end (delta: -9.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,777 INFO L158 Benchmark]: TraceAbstraction took 8248.12ms. Allocated memory was 130.0MB in the beginning and 262.1MB in the end (delta: 132.1MB). Free memory was 70.9MB in the beginning and 140.3MB in the end (delta: -69.4MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,778 INFO L158 Benchmark]: Witness Printer took 148.35ms. Allocated memory is still 262.1MB. Free memory was 140.3MB in the beginning and 113.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-02 20:54:05,780 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.28ms. Allocated memory is still 104.9MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 789.33ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 67.0MB in the end (delta: -5.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.96ms. Allocated memory is still 104.9MB. Free memory was 66.7MB in the beginning and 64.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.77ms. Allocated memory is still 104.9MB. Free memory was 64.0MB in the beginning and 61.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1427.61ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 61.6MB in the beginning and 71.0MB in the end (delta: -9.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8248.12ms. Allocated memory was 130.0MB in the beginning and 262.1MB in the end (delta: 132.1MB). Free memory was 70.9MB in the beginning and 140.3MB in the end (delta: -69.4MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 148.35ms. Allocated memory is still 262.1MB. Free memory was 140.3MB in the beginning and 113.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1108; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=-2, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 826]: 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: 828]: 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, 146 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: 8.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 772 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 49 mSDtfsCounter, 772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=7, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 1974 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-11-02 20:54:05,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fd29b65-a26f-4b48-afb0-813735ad82d9/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE