./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8 --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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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-e04fb08 [2022-11-16 11:54:37,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:54:37,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:54:37,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:54:37,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:54:37,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:54:37,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:54:37,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:54:37,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:54:37,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:54:37,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:54:37,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:54:37,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:54:37,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:54:37,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:54:37,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:54:37,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:54:37,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:54:37,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:54:37,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:54:37,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:54:37,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:54:37,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:54:37,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:54:37,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:54:37,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:54:37,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:54:37,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:54:37,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:54:37,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:54:37,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:54:37,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:54:37,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:54:37,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:54:37,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:54:37,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:54:37,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:54:37,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:54:37,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:54:37,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:54:37,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:54:37,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:54:38,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:54:38,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:54:38,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:54:38,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:54:38,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:54:38,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:54:38,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:54:38,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:54:38,014 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:54:38,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:54:38,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:54:38,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:54:38,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:54:38,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:54:38,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:54:38,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:54:38,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:54:38,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:54:38,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:54:38,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:54:38,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:54:38,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:54:38,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:54:38,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:54:38,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:38,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:54:38,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:54:38,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:54:38,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:54:38,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:54:38,020 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:54:38,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:54:38,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:54:38,021 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_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/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_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-16 11:54:38,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:54:38,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:54:38,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:54:38,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:54:38,335 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:54:38,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-16 11:54:38,397 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/data/2b39adcbf/b31876572d0b4e47a8ac2ad809816107/FLAG94498d04f [2022-11-16 11:54:38,890 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:54:38,891 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-16 11:54:38,915 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/data/2b39adcbf/b31876572d0b4e47a8ac2ad809816107/FLAG94498d04f [2022-11-16 11:54:39,213 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/data/2b39adcbf/b31876572d0b4e47a8ac2ad809816107 [2022-11-16 11:54:39,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:54:39,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:54:39,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:39,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:54:39,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:54:39,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd4b7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39, skipping insertion in model container [2022-11-16 11:54:39,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:54:39,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:54:39,480 WARN L229 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_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-16 11:54:39,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:39,739 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:54:39,753 WARN L229 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_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-16 11:54:39,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:39,834 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:54:39,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39 WrapperNode [2022-11-16 11:54:39,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:39,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:39,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:54:39,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:54:39,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,894 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-11-16 11:54:39,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:39,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:54:39,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:54:39,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:54:39,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,921 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:54:39,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:54:39,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:54:39,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:54:39,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (1/1) ... [2022-11-16 11:54:39,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:39,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:54:39,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:54:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:54:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:54:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:54:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:54:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:54:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:54:40,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:54:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:54:40,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:54:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:54:40,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:54:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:54:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:54:40,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:54:40,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:54:40,014 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:54:40,255 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:54:40,257 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:54:40,634 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:54:40,876 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:54:40,876 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:54:40,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:40 BoogieIcfgContainer [2022-11-16 11:54:40,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:54:40,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:54:40,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:54:40,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:54:40,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:54:39" (1/3) ... [2022-11-16 11:54:40,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473d21b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:40, skipping insertion in model container [2022-11-16 11:54:40,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:39" (2/3) ... [2022-11-16 11:54:40,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473d21b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:40, skipping insertion in model container [2022-11-16 11:54:40,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:40" (3/3) ... [2022-11-16 11:54:40,890 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-16 11:54:40,899 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:54:40,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:54:40,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:54:40,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:54:40,998 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:54:41,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-16 11:54:41,107 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-16 11:54:41,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:54:41,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-16 11:54:41,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-11-16 11:54:41,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-11-16 11:54:41,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:54:41,149 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;@36fa09fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:54:41,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:54:41,175 INFO L130 PetriNetUnfolder]: 0/51 cut-off events. [2022-11-16 11:54:41,179 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:54:41,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:41,180 INFO L209 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] [2022-11-16 11:54:41,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2082856008, now seen corresponding path program 1 times [2022-11-16 11:54:41,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:41,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462588110] [2022-11-16 11:54:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:41,864 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-16 11:54:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:41,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462588110] [2022-11-16 11:54:41,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462588110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:41,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:41,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:54:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436287165] [2022-11-16 11:54:41,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:41,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:54:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:54:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:41,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 124 [2022-11-16 11:54:41,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 11:54:41,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:41,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 124 [2022-11-16 11:54:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:42,055 INFO L130 PetriNetUnfolder]: 58/313 cut-off events. [2022-11-16 11:54:42,055 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-16 11:54:42,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 313 events. 58/313 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1388 event pairs, 10 based on Foata normal form. 24/325 useless extension candidates. Maximal degree in co-relation 385. Up to 79 conditions per place. [2022-11-16 11:54:42,060 INFO L137 encePairwiseOnDemand]: 119/124 looper letters, 14 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2022-11-16 11:54:42,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 123 transitions, 293 flow [2022-11-16 11:54:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:54:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:54:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-11-16 11:54:42,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9435483870967742 [2022-11-16 11:54:42,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-11-16 11:54:42,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-11-16 11:54:42,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:42,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-11-16 11:54:42,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-16 11:54:42,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 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-16 11:54:42,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 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-16 11:54:42,092 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 251 flow. Second operand 3 states and 351 transitions. [2022-11-16 11:54:42,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 123 transitions, 293 flow [2022-11-16 11:54:42,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 288 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:54:42,100 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 244 flow [2022-11-16 11:54:42,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2022-11-16 11:54:42,106 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, -3 predicate places. [2022-11-16 11:54:42,107 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 244 flow [2022-11-16 11:54:42,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 11:54:42,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:42,108 INFO L209 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] [2022-11-16 11:54:42,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:54:42,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1775830211, now seen corresponding path program 1 times [2022-11-16 11:54:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:42,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197099650] [2022-11-16 11:54:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:42,757 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-16 11:54:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:42,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197099650] [2022-11-16 11:54:42,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197099650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:42,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:42,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353224537] [2022-11-16 11:54:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:42,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:42,763 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-11-16 11:54:42,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 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-16 11:54:42,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:42,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-11-16 11:54:42,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:44,074 INFO L130 PetriNetUnfolder]: 1820/4239 cut-off events. [2022-11-16 11:54:44,074 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-11-16 11:54:44,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7112 conditions, 4239 events. 1820/4239 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 33292 event pairs, 912 based on Foata normal form. 0/4104 useless extension candidates. Maximal degree in co-relation 7050. Up to 1241 conditions per place. [2022-11-16 11:54:44,097 INFO L137 encePairwiseOnDemand]: 118/124 looper letters, 33 selfloop transitions, 2 changer transitions 69/183 dead transitions. [2022-11-16 11:54:44,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 183 transitions, 572 flow [2022-11-16 11:54:44,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:54:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:54:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2022-11-16 11:54:44,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8351254480286738 [2022-11-16 11:54:44,102 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2022-11-16 11:54:44,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2022-11-16 11:54:44,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:44,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2022-11-16 11:54:44,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.55555555555556) internal successors, (932), 9 states have internal predecessors, (932), 0 states have call successors, (0), 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-16 11:54:44,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 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-16 11:54:44,109 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 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-16 11:54:44,110 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 244 flow. Second operand 9 states and 932 transitions. [2022-11-16 11:54:44,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 183 transitions, 572 flow [2022-11-16 11:54:44,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 183 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:54:44,114 INFO L231 Difference]: Finished difference. Result has 139 places, 105 transitions, 236 flow [2022-11-16 11:54:44,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=139, PETRI_TRANSITIONS=105} [2022-11-16 11:54:44,115 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 10 predicate places. [2022-11-16 11:54:44,115 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 105 transitions, 236 flow [2022-11-16 11:54:44,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 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-16 11:54:44,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:44,116 INFO L209 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-16 11:54:44,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:54:44,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1872904768, now seen corresponding path program 1 times [2022-11-16 11:54:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:44,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965872975] [2022-11-16 11:54:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:44,553 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-16 11:54:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:44,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965872975] [2022-11-16 11:54:44,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965872975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:44,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:44,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487515219] [2022-11-16 11:54:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:44,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:44,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-11-16 11:54:44,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 105 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 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-16 11:54:44,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:44,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-11-16 11:54:44,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:45,327 INFO L130 PetriNetUnfolder]: 1079/2012 cut-off events. [2022-11-16 11:54:45,328 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-11-16 11:54:45,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4248 conditions, 2012 events. 1079/2012 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11567 event pairs, 238 based on Foata normal form. 48/2007 useless extension candidates. Maximal degree in co-relation 4179. Up to 923 conditions per place. [2022-11-16 11:54:45,341 INFO L137 encePairwiseOnDemand]: 117/124 looper letters, 31 selfloop transitions, 3 changer transitions 46/159 dead transitions. [2022-11-16 11:54:45,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 159 transitions, 525 flow [2022-11-16 11:54:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:54:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:54:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2022-11-16 11:54:45,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8161290322580645 [2022-11-16 11:54:45,345 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1012 transitions. [2022-11-16 11:54:45,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1012 transitions. [2022-11-16 11:54:45,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:45,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1012 transitions. [2022-11-16 11:54:45,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.2) internal successors, (1012), 10 states have internal predecessors, (1012), 0 states have call successors, (0), 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-16 11:54:45,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:45,353 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:45,353 INFO L175 Difference]: Start difference. First operand has 139 places, 105 transitions, 236 flow. Second operand 10 states and 1012 transitions. [2022-11-16 11:54:45,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 159 transitions, 525 flow [2022-11-16 11:54:45,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 159 transitions, 491 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-16 11:54:45,375 INFO L231 Difference]: Finished difference. Result has 129 places, 105 transitions, 242 flow [2022-11-16 11:54:45,376 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=242, PETRI_PLACES=129, PETRI_TRANSITIONS=105} [2022-11-16 11:54:45,378 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2022-11-16 11:54:45,379 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 105 transitions, 242 flow [2022-11-16 11:54:45,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 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-16 11:54:45,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:45,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:45,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:54:45,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1269586856, now seen corresponding path program 1 times [2022-11-16 11:54:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:45,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51184038] [2022-11-16 11:54:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:45,767 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-16 11:54:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51184038] [2022-11-16 11:54:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51184038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:45,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028705307] [2022-11-16 11:54:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:45,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:45,772 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 124 [2022-11-16 11:54:45,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 105 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 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-16 11:54:45,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:45,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 124 [2022-11-16 11:54:45,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:46,439 INFO L130 PetriNetUnfolder]: 867/1770 cut-off events. [2022-11-16 11:54:46,439 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-11-16 11:54:46,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 1770 events. 867/1770 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9865 event pairs, 356 based on Foata normal form. 36/1708 useless extension candidates. Maximal degree in co-relation 3597. Up to 815 conditions per place. [2022-11-16 11:54:46,452 INFO L137 encePairwiseOnDemand]: 117/124 looper letters, 32 selfloop transitions, 3 changer transitions 40/154 dead transitions. [2022-11-16 11:54:46,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 154 transitions, 516 flow [2022-11-16 11:54:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:54:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:54:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1007 transitions. [2022-11-16 11:54:46,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8120967741935484 [2022-11-16 11:54:46,456 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1007 transitions. [2022-11-16 11:54:46,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1007 transitions. [2022-11-16 11:54:46,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:46,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1007 transitions. [2022-11-16 11:54:46,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.7) internal successors, (1007), 10 states have internal predecessors, (1007), 0 states have call successors, (0), 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-16 11:54:46,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:46,467 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:46,467 INFO L175 Difference]: Start difference. First operand has 129 places, 105 transitions, 242 flow. Second operand 10 states and 1007 transitions. [2022-11-16 11:54:46,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 154 transitions, 516 flow [2022-11-16 11:54:46,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 154 transitions, 480 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-16 11:54:46,482 INFO L231 Difference]: Finished difference. Result has 130 places, 105 transitions, 246 flow [2022-11-16 11:54:46,483 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=130, PETRI_TRANSITIONS=105} [2022-11-16 11:54:46,484 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2022-11-16 11:54:46,489 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 105 transitions, 246 flow [2022-11-16 11:54:46,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 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-16 11:54:46,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:46,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:46,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:54:46,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash -36994912, now seen corresponding path program 1 times [2022-11-16 11:54:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:46,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176912536] [2022-11-16 11:54:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:46,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:46,781 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-16 11:54:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176912536] [2022-11-16 11:54:46,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176912536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:46,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:46,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:54:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786790981] [2022-11-16 11:54:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:46,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:54:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:54:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:46,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-11-16 11:54:46,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 105 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 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-16 11:54:46,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:46,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-11-16 11:54:46,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:47,459 INFO L130 PetriNetUnfolder]: 917/1935 cut-off events. [2022-11-16 11:54:47,459 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-11-16 11:54:47,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1935 events. 917/1935 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12861 event pairs, 60 based on Foata normal form. 0/1896 useless extension candidates. Maximal degree in co-relation 3574. Up to 481 conditions per place. [2022-11-16 11:54:47,473 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 31 selfloop transitions, 6 changer transitions 50/172 dead transitions. [2022-11-16 11:54:47,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 172 transitions, 558 flow [2022-11-16 11:54:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:54:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:54:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1089 transitions. [2022-11-16 11:54:47,477 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8782258064516129 [2022-11-16 11:54:47,477 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1089 transitions. [2022-11-16 11:54:47,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1089 transitions. [2022-11-16 11:54:47,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:47,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1089 transitions. [2022-11-16 11:54:47,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 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-16 11:54:47,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:47,484 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:47,484 INFO L175 Difference]: Start difference. First operand has 130 places, 105 transitions, 246 flow. Second operand 10 states and 1089 transitions. [2022-11-16 11:54:47,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 172 transitions, 558 flow [2022-11-16 11:54:47,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 172 transitions, 540 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-11-16 11:54:47,490 INFO L231 Difference]: Finished difference. Result has 130 places, 107 transitions, 282 flow [2022-11-16 11:54:47,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=107} [2022-11-16 11:54:47,491 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2022-11-16 11:54:47,491 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 107 transitions, 282 flow [2022-11-16 11:54:47,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 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-16 11:54:47,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:47,492 INFO L209 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-16 11:54:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:54:47,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 543755243, now seen corresponding path program 1 times [2022-11-16 11:54:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898051007] [2022-11-16 11:54:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:47,801 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-16 11:54:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:47,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898051007] [2022-11-16 11:54:47,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898051007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:47,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:47,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661089349] [2022-11-16 11:54:47,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:47,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:47,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-11-16 11:54:47,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 107 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 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-16 11:54:47,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:47,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-11-16 11:54:47,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:48,227 INFO L130 PetriNetUnfolder]: 316/855 cut-off events. [2022-11-16 11:54:48,227 INFO L131 PetriNetUnfolder]: For 700/706 co-relation queries the response was YES. [2022-11-16 11:54:48,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 855 events. 316/855 cut-off events. For 700/706 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4950 event pairs, 25 based on Foata normal form. 30/878 useless extension candidates. Maximal degree in co-relation 2056. Up to 182 conditions per place. [2022-11-16 11:54:48,234 INFO L137 encePairwiseOnDemand]: 115/124 looper letters, 37 selfloop transitions, 9 changer transitions 39/170 dead transitions. [2022-11-16 11:54:48,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 170 transitions, 711 flow [2022-11-16 11:54:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:54:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:54:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1087 transitions. [2022-11-16 11:54:48,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8766129032258064 [2022-11-16 11:54:48,238 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1087 transitions. [2022-11-16 11:54:48,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1087 transitions. [2022-11-16 11:54:48,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:48,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1087 transitions. [2022-11-16 11:54:48,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 0 states have call successors, (0), 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-16 11:54:48,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:48,244 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 0 states have call successors, (0), 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-16 11:54:48,244 INFO L175 Difference]: Start difference. First operand has 130 places, 107 transitions, 282 flow. Second operand 10 states and 1087 transitions. [2022-11-16 11:54:48,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 170 transitions, 711 flow [2022-11-16 11:54:48,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 170 transitions, 687 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-16 11:54:48,250 INFO L231 Difference]: Finished difference. Result has 134 places, 110 transitions, 350 flow [2022-11-16 11:54:48,251 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2022-11-16 11:54:48,251 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 5 predicate places. [2022-11-16 11:54:48,252 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 350 flow [2022-11-16 11:54:48,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 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-16 11:54:48,252 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:48,253 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:48,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:54:48,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -922596598, now seen corresponding path program 1 times [2022-11-16 11:54:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:48,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668046315] [2022-11-16 11:54:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:48,577 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-16 11:54:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668046315] [2022-11-16 11:54:48,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668046315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:48,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:54:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24377260] [2022-11-16 11:54:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:48,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:54:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:54:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:48,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 124 [2022-11-16 11:54:48,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 0 states have call successors, (0), 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-16 11:54:48,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:48,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 124 [2022-11-16 11:54:48,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:49,081 INFO L130 PetriNetUnfolder]: 329/1099 cut-off events. [2022-11-16 11:54:49,081 INFO L131 PetriNetUnfolder]: For 1316/1382 co-relation queries the response was YES. [2022-11-16 11:54:49,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1099 events. 329/1099 cut-off events. For 1316/1382 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6761 event pairs, 67 based on Foata normal form. 25/1103 useless extension candidates. Maximal degree in co-relation 2595. Up to 278 conditions per place. [2022-11-16 11:54:49,092 INFO L137 encePairwiseOnDemand]: 116/124 looper letters, 44 selfloop transitions, 4 changer transitions 20/150 dead transitions. [2022-11-16 11:54:49,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 150 transitions, 576 flow [2022-11-16 11:54:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:54:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 797 transitions. [2022-11-16 11:54:49,095 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8034274193548387 [2022-11-16 11:54:49,095 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 797 transitions. [2022-11-16 11:54:49,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 797 transitions. [2022-11-16 11:54:49,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:49,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 797 transitions. [2022-11-16 11:54:49,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 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-16 11:54:49,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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-16 11:54:49,101 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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-16 11:54:49,101 INFO L175 Difference]: Start difference. First operand has 134 places, 110 transitions, 350 flow. Second operand 8 states and 797 transitions. [2022-11-16 11:54:49,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 150 transitions, 576 flow [2022-11-16 11:54:49,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 150 transitions, 520 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-16 11:54:49,111 INFO L231 Difference]: Finished difference. Result has 133 places, 111 transitions, 317 flow [2022-11-16 11:54:49,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=133, PETRI_TRANSITIONS=111} [2022-11-16 11:54:49,112 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 4 predicate places. [2022-11-16 11:54:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 111 transitions, 317 flow [2022-11-16 11:54:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 0 states have call successors, (0), 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-16 11:54:49,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:49,113 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:54:49,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1859657122, now seen corresponding path program 2 times [2022-11-16 11:54:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:49,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366262790] [2022-11-16 11:54:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:49,478 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-16 11:54:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:49,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366262790] [2022-11-16 11:54:49,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366262790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:49,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:49,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:54:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518975850] [2022-11-16 11:54:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:54:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:54:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:49,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2022-11-16 11:54:49,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 111 transitions, 317 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:49,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:49,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2022-11-16 11:54:49,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:49,869 INFO L130 PetriNetUnfolder]: 196/656 cut-off events. [2022-11-16 11:54:49,870 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-11-16 11:54:49,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 656 events. 196/656 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3796 event pairs, 41 based on Foata normal form. 18/650 useless extension candidates. Maximal degree in co-relation 1446. Up to 108 conditions per place. [2022-11-16 11:54:49,874 INFO L137 encePairwiseOnDemand]: 115/124 looper letters, 26 selfloop transitions, 12 changer transitions 24/147 dead transitions. [2022-11-16 11:54:49,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 147 transitions, 578 flow [2022-11-16 11:54:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:54:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:54:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1163 transitions. [2022-11-16 11:54:49,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8526392961876833 [2022-11-16 11:54:49,877 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1163 transitions. [2022-11-16 11:54:49,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1163 transitions. [2022-11-16 11:54:49,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:49,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1163 transitions. [2022-11-16 11:54:49,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.72727272727273) internal successors, (1163), 11 states have internal predecessors, (1163), 0 states have call successors, (0), 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-16 11:54:49,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 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-16 11:54:49,885 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 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-16 11:54:49,885 INFO L175 Difference]: Start difference. First operand has 133 places, 111 transitions, 317 flow. Second operand 11 states and 1163 transitions. [2022-11-16 11:54:49,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 147 transitions, 578 flow [2022-11-16 11:54:49,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 147 transitions, 537 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-11-16 11:54:49,890 INFO L231 Difference]: Finished difference. Result has 138 places, 110 transitions, 328 flow [2022-11-16 11:54:49,890 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=328, PETRI_PLACES=138, PETRI_TRANSITIONS=110} [2022-11-16 11:54:49,893 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 9 predicate places. [2022-11-16 11:54:49,893 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 110 transitions, 328 flow [2022-11-16 11:54:49,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:49,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:49,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:49,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:54:49,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2016469337, now seen corresponding path program 1 times [2022-11-16 11:54:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:49,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140387028] [2022-11-16 11:54:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:50,274 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-16 11:54:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140387028] [2022-11-16 11:54:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140387028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:50,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:50,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082280972] [2022-11-16 11:54:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:50,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:50,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 124 [2022-11-16 11:54:50,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 110 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 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-16 11:54:50,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:50,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 124 [2022-11-16 11:54:50,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:50,657 INFO L130 PetriNetUnfolder]: 225/725 cut-off events. [2022-11-16 11:54:50,657 INFO L131 PetriNetUnfolder]: For 327/337 co-relation queries the response was YES. [2022-11-16 11:54:50,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 725 events. 225/725 cut-off events. For 327/337 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4184 event pairs, 35 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 1531. Up to 261 conditions per place. [2022-11-16 11:54:50,662 INFO L137 encePairwiseOnDemand]: 112/124 looper letters, 32 selfloop transitions, 8 changer transitions 9/131 dead transitions. [2022-11-16 11:54:50,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 476 flow [2022-11-16 11:54:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:54:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 778 transitions. [2022-11-16 11:54:50,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7842741935483871 [2022-11-16 11:54:50,665 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 778 transitions. [2022-11-16 11:54:50,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 778 transitions. [2022-11-16 11:54:50,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:50,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 778 transitions. [2022-11-16 11:54:50,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.25) internal successors, (778), 8 states have internal predecessors, (778), 0 states have call successors, (0), 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-16 11:54:50,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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-16 11:54:50,669 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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-16 11:54:50,670 INFO L175 Difference]: Start difference. First operand has 138 places, 110 transitions, 328 flow. Second operand 8 states and 778 transitions. [2022-11-16 11:54:50,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 476 flow [2022-11-16 11:54:50,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 131 transitions, 396 flow, removed 21 selfloop flow, removed 16 redundant places. [2022-11-16 11:54:50,675 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 307 flow [2022-11-16 11:54:50,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2022-11-16 11:54:50,676 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2022-11-16 11:54:50,676 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 307 flow [2022-11-16 11:54:50,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 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-16 11:54:50,677 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:50,677 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:50,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:54:50,677 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1967093, now seen corresponding path program 2 times [2022-11-16 11:54:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:50,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328895500] [2022-11-16 11:54:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:51,837 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-16 11:54:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:51,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328895500] [2022-11-16 11:54:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328895500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:51,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:51,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:54:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735605636] [2022-11-16 11:54:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:51,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:54:51,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:51,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:54:51,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:54:51,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 124 [2022-11-16 11:54:51,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 307 flow. Second operand has 11 states, 11 states have (on average 97.18181818181819) internal successors, (1069), 11 states have internal predecessors, (1069), 0 states have call successors, (0), 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-16 11:54:51,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:51,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 124 [2022-11-16 11:54:51,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:52,244 INFO L130 PetriNetUnfolder]: 103/575 cut-off events. [2022-11-16 11:54:52,244 INFO L131 PetriNetUnfolder]: For 48/49 co-relation queries the response was YES. [2022-11-16 11:54:52,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 575 events. 103/575 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3416 event pairs, 9 based on Foata normal form. 1/561 useless extension candidates. Maximal degree in co-relation 1003. Up to 60 conditions per place. [2022-11-16 11:54:52,248 INFO L137 encePairwiseOnDemand]: 114/124 looper letters, 26 selfloop transitions, 5 changer transitions 12/133 dead transitions. [2022-11-16 11:54:52,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 133 transitions, 451 flow [2022-11-16 11:54:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:54:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:54:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1087 transitions. [2022-11-16 11:54:52,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7969208211143695 [2022-11-16 11:54:52,253 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1087 transitions. [2022-11-16 11:54:52,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1087 transitions. [2022-11-16 11:54:52,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:52,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1087 transitions. [2022-11-16 11:54:52,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 0 states have call successors, (0), 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-16 11:54:52,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 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-16 11:54:52,260 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 0 states have call successors, (0), 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-16 11:54:52,260 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 307 flow. Second operand 11 states and 1087 transitions. [2022-11-16 11:54:52,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 133 transitions, 451 flow [2022-11-16 11:54:52,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 133 transitions, 436 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-16 11:54:52,263 INFO L231 Difference]: Finished difference. Result has 136 places, 115 transitions, 320 flow [2022-11-16 11:54:52,264 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=320, PETRI_PLACES=136, PETRI_TRANSITIONS=115} [2022-11-16 11:54:52,265 INFO L288 CegarLoopForPetriNet]: 129 programPoint places, 7 predicate places. [2022-11-16 11:54:52,266 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 115 transitions, 320 flow [2022-11-16 11:54:52,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 97.18181818181819) internal successors, (1069), 11 states have internal predecessors, (1069), 0 states have call successors, (0), 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-16 11:54:52,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:52,267 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:52,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:54:52,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:54:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -510087163, now seen corresponding path program 3 times [2022-11-16 11:54:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144337031] [2022-11-16 11:54:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:54:52,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:54:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:54:52,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:54:52,464 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:54:52,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:54:52,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:54:52,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:54:52,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:54:52,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:54:52,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:54:52,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:54:52,469 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:52,475 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:54:52,475 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:54:52,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:54:52 BasicIcfg [2022-11-16 11:54:52,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:54:52,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:54:52,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:54:52,644 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:54:52,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:40" (3/4) ... [2022-11-16 11:54:52,647 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:54:52,801 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:54:52,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:54:52,803 INFO L158 Benchmark]: Toolchain (without parser) took 13586.28ms. Allocated memory was 113.2MB in the beginning and 413.1MB in the end (delta: 299.9MB). Free memory was 71.3MB in the beginning and 117.7MB in the end (delta: -46.4MB). Peak memory consumption was 254.3MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,803 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:54:52,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.08ms. Allocated memory is still 113.2MB. Free memory was 71.1MB in the beginning and 75.0MB in the end (delta: -3.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.80ms. Allocated memory is still 113.2MB. Free memory was 75.0MB in the beginning and 72.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,804 INFO L158 Benchmark]: Boogie Preprocessor took 30.30ms. Allocated memory is still 113.2MB. Free memory was 72.3MB in the beginning and 70.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,804 INFO L158 Benchmark]: RCFGBuilder took 953.14ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 70.5MB in the beginning and 103.0MB in the end (delta: -32.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,805 INFO L158 Benchmark]: TraceAbstraction took 11762.20ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 102.5MB in the beginning and 145.0MB in the end (delta: -42.5MB). Peak memory consumption was 235.3MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,805 INFO L158 Benchmark]: Witness Printer took 157.80ms. Allocated memory is still 413.1MB. Free memory was 145.0MB in the beginning and 117.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-16 11:54:52,808 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.20ms. Allocated memory is still 113.2MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.08ms. Allocated memory is still 113.2MB. Free memory was 71.1MB in the beginning and 75.0MB in the end (delta: -3.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.80ms. Allocated memory is still 113.2MB. Free memory was 75.0MB in the beginning and 72.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.30ms. Allocated memory is still 113.2MB. Free memory was 72.3MB in the beginning and 70.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 953.14ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 70.5MB in the beginning and 103.0MB in the end (delta: -32.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11762.20ms. Allocated memory was 136.3MB in the beginning and 413.1MB in the end (delta: 276.8MB). Free memory was 102.5MB in the beginning and 145.0MB in the end (delta: -42.5MB). Peak memory consumption was 235.3MB. Max. memory is 16.1GB. * Witness Printer took 157.80ms. Allocated memory is still 413.1MB. Free memory was 145.0MB in the beginning and 117.7MB 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: [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L739] 0 _Bool a$w_buff1_used; VAL [__unbuffered_p2_EBX=0, a$w_buff1_used=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, a$w_buff1_used=0, weak$$choice0=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L725] 0 int a$mem_tmp; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, a$mem_tmp=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 _Bool a$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L723] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L736] 0 int a$w_buff0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L738] 0 int a$w_buff1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L724] 0 _Bool a$flush_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L735] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L741] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L740] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L737] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L727] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L726] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L729] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L728] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L743] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t38; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L875] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=255, x=1, y=1, 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: 860]: 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: 856]: 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: 858]: 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, 155 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: 11.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 681 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1304 IncrementalHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 159 mSDtfsCounter, 1304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=6, InterpolantAutomatonStates: 90, 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, 4.3s InterpolantComputationTime, 963 NumberOfCodeBlocks, 963 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-16 11:54:52,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ade27d2-33e0-4c4e-9977-80df0f4be6c0/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE