./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.opt.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_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/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_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/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_00d44d4a-24a6-45af-a860-d598ea1085ca/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 dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 --- 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:50:58,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:50:58,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:50:58,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:50:58,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:50:58,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:50:58,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:50:58,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:50:58,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:50:58,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:50:58,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:50:58,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:50:58,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:50:58,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:50:58,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:50:58,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:50:58,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:50:58,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:50:58,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:50:58,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:50:58,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:50:58,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:50:58,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:50:58,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:50:58,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:50:58,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:50:58,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:50:58,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:50:58,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:50:58,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:50:58,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:50:58,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:50:58,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:50:58,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:50:58,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:50:58,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:50:58,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:50:58,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:50:58,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:50:58,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:50:58,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:50:58,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:50:58,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:50:58,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:50:58,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:50:58,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:50:58,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:50:58,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:50:58,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:50:58,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:50:58,408 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:50:58,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:50:58,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:50:58,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:50:58,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:50:58,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:50:58,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:50:58,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:50:58,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:50:58,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:50:58,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:50:58,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:50:58,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:50:58,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:50:58,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:50:58,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:50:58,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:50:58,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:50:58,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:50:58,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:50:58,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:50:58,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:50:58,418 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:50:58,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:50:58,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:50:58,419 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_00d44d4a-24a6-45af-a860-d598ea1085ca/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_00d44d4a-24a6-45af-a860-d598ea1085ca/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 -> dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 [2022-11-16 11:50:58,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:50:58,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:50:58,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:50:58,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:50:58,870 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:50:58,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix002.opt.i [2022-11-16 11:50:58,956 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/data/a19a8f52a/f405df4d51a74a2ca0eca2b31a52669f/FLAG809df14c0 [2022-11-16 11:50:59,646 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:50:59,646 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/sv-benchmarks/c/pthread-wmm/mix002.opt.i [2022-11-16 11:50:59,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/data/a19a8f52a/f405df4d51a74a2ca0eca2b31a52669f/FLAG809df14c0 [2022-11-16 11:50:59,842 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/data/a19a8f52a/f405df4d51a74a2ca0eca2b31a52669f [2022-11-16 11:50:59,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:50:59,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:50:59,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:50:59,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:50:59,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:50:59,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:59" (1/1) ... [2022-11-16 11:50:59,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308f9317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:59, skipping insertion in model container [2022-11-16 11:50:59,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:59" (1/1) ... [2022-11-16 11:50:59,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:50:59,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:51:00,242 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_00d44d4a-24a6-45af-a860-d598ea1085ca/sv-benchmarks/c/pthread-wmm/mix002.opt.i[944,957] [2022-11-16 11:51:00,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:51:00,567 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:51:00,584 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_00d44d4a-24a6-45af-a860-d598ea1085ca/sv-benchmarks/c/pthread-wmm/mix002.opt.i[944,957] [2022-11-16 11:51:00,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:51:00,718 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:51:00,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00 WrapperNode [2022-11-16 11:51:00,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:51:00,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:51:00,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:51:00,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:51:00,730 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:51:00" (1/1) ... [2022-11-16 11:51:00,759 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:51:00" (1/1) ... [2022-11-16 11:51:00,795 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-11-16 11:51:00,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:51:00,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:51:00,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:51:00,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:51:00,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,834 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:51:00,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:51:00,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:51:00,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:51:00,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (1/1) ... [2022-11-16 11:51:00,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:51:00,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:00,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:51:00,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:51:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:51:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:51:00,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:51:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:51:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:51:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:51:00,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:51:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:51:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:51:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:51:00,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:51:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:51:00,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:51:00,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:51:00,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:51:00,950 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:51:01,133 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:51:01,135 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:51:01,745 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:51:01,963 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:51:01,964 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:51:01,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:01 BoogieIcfgContainer [2022-11-16 11:51:01,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:51:01,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:51:01,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:51:01,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:51:01,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:50:59" (1/3) ... [2022-11-16 11:51:01,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fb7003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:51:01, skipping insertion in model container [2022-11-16 11:51:01,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:00" (2/3) ... [2022-11-16 11:51:01,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fb7003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:51:01, skipping insertion in model container [2022-11-16 11:51:01,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:01" (3/3) ... [2022-11-16 11:51:01,980 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2022-11-16 11:51:01,991 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:51:02,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:51:02,005 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:51:02,005 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:51:02,079 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:51:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-11-16 11:51:02,220 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-16 11:51:02,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:51:02,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-16 11:51:02,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-11-16 11:51:02,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-11-16 11:51:02,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:51:02,264 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;@69dd4cdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:51:02,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:51:02,290 INFO L130 PetriNetUnfolder]: 0/80 cut-off events. [2022-11-16 11:51:02,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:51:02,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:02,291 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] [2022-11-16 11:51:02,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -39668922, now seen corresponding path program 1 times [2022-11-16 11:51:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:02,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412439088] [2022-11-16 11:51:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:03,209 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:51:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412439088] [2022-11-16 11:51:03,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412439088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:03,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:03,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:51:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093938274] [2022-11-16 11:51:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:03,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:51:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:03,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:51:03,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:51:03,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 122 [2022-11-16 11:51:03,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:03,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:03,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 122 [2022-11-16 11:51:03,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:03,386 INFO L130 PetriNetUnfolder]: 14/158 cut-off events. [2022-11-16 11:51:03,386 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 11:51:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 158 events. 14/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 286 event pairs, 2 based on Foata normal form. 7/156 useless extension candidates. Maximal degree in co-relation 148. Up to 25 conditions per place. [2022-11-16 11:51:03,390 INFO L137 encePairwiseOnDemand]: 117/122 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-11-16 11:51:03,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 265 flow [2022-11-16 11:51:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:51:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:51:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2022-11-16 11:51:03,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9371584699453552 [2022-11-16 11:51:03,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2022-11-16 11:51:03,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2022-11-16 11:51:03,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:03,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2022-11-16 11:51:03,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:51:03,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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:51:03,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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:51:03,452 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 343 transitions. [2022-11-16 11:51:03,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 265 flow [2022-11-16 11:51:03,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:51:03,462 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2022-11-16 11:51:03,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2022-11-16 11:51:03,469 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-11-16 11:51:03,469 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2022-11-16 11:51:03,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:03,470 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:03,470 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:51:03,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:51:03,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1157321458, now seen corresponding path program 1 times [2022-11-16 11:51:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919508182] [2022-11-16 11:51:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:04,002 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:51:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:04,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919508182] [2022-11-16 11:51:04,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919508182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:04,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473918438] [2022-11-16 11:51:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:04,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:04,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:04,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:04,017 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-11-16 11:51:04,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 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:51:04,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:04,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-11-16 11:51:04,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:05,302 INFO L130 PetriNetUnfolder]: 966/2625 cut-off events. [2022-11-16 11:51:05,302 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-16 11:51:05,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 2625 events. 966/2625 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 20238 event pairs, 122 based on Foata normal form. 0/2563 useless extension candidates. Maximal degree in co-relation 4172. Up to 734 conditions per place. [2022-11-16 11:51:05,332 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 31 selfloop transitions, 2 changer transitions 63/175 dead transitions. [2022-11-16 11:51:05,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 175 transitions, 548 flow [2022-11-16 11:51:05,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:51:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:51:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 924 transitions. [2022-11-16 11:51:05,342 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2022-11-16 11:51:05,342 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 924 transitions. [2022-11-16 11:51:05,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 924 transitions. [2022-11-16 11:51:05,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:05,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 924 transitions. [2022-11-16 11:51:05,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.66666666666667) internal successors, (924), 9 states have internal predecessors, (924), 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:51:05,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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:51:05,353 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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:51:05,353 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 9 states and 924 transitions. [2022-11-16 11:51:05,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 175 transitions, 548 flow [2022-11-16 11:51:05,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 175 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:51:05,362 INFO L231 Difference]: Finished difference. Result has 137 places, 103 transitions, 232 flow [2022-11-16 11:51:05,363 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2022-11-16 11:51:05,364 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2022-11-16 11:51:05,364 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 232 flow [2022-11-16 11:51:05,365 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:51:05,365 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:05,365 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:51:05,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:51:05,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1081542964, now seen corresponding path program 1 times [2022-11-16 11:51:05,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:05,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723722884] [2022-11-16 11:51:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:05,788 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:51:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:05,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723722884] [2022-11-16 11:51:05,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723722884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:05,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:05,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057038428] [2022-11-16 11:51:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:05,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:05,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:05,799 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-11-16 11:51:05,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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:51:05,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:05,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-11-16 11:51:05,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:06,518 INFO L130 PetriNetUnfolder]: 558/1173 cut-off events. [2022-11-16 11:51:06,518 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-11-16 11:51:06,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1173 events. 558/1173 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6121 event pairs, 218 based on Foata normal form. 30/1151 useless extension candidates. Maximal degree in co-relation 2366. Up to 476 conditions per place. [2022-11-16 11:51:06,529 INFO L137 encePairwiseOnDemand]: 115/122 looper letters, 29 selfloop transitions, 3 changer transitions 43/154 dead transitions. [2022-11-16 11:51:06,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 154 transitions, 507 flow [2022-11-16 11:51:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:51:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:51:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1007 transitions. [2022-11-16 11:51:06,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8254098360655737 [2022-11-16 11:51:06,533 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1007 transitions. [2022-11-16 11:51:06,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1007 transitions. [2022-11-16 11:51:06,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:06,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1007 transitions. [2022-11-16 11:51:06,538 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:51:06,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:06,542 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:06,542 INFO L175 Difference]: Start difference. First operand has 137 places, 103 transitions, 232 flow. Second operand 10 states and 1007 transitions. [2022-11-16 11:51:06,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 154 transitions, 507 flow [2022-11-16 11:51:06,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 154 transitions, 473 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-16 11:51:06,555 INFO L231 Difference]: Finished difference. Result has 127 places, 103 transitions, 238 flow [2022-11-16 11:51:06,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2022-11-16 11:51:06,557 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-11-16 11:51:06,557 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 238 flow [2022-11-16 11:51:06,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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:51:06,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:06,558 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:51:06,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:51:06,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1023331371, now seen corresponding path program 1 times [2022-11-16 11:51:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286178003] [2022-11-16 11:51:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:06,932 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:51:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:06,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286178003] [2022-11-16 11:51:06,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286178003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:06,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:06,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324610713] [2022-11-16 11:51:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:06,937 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-11-16 11:51:06,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 238 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:51:06,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:06,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-11-16 11:51:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:07,485 INFO L130 PetriNetUnfolder]: 394/899 cut-off events. [2022-11-16 11:51:07,485 INFO L131 PetriNetUnfolder]: For 303/303 co-relation queries the response was YES. [2022-11-16 11:51:07,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 899 events. 394/899 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4483 event pairs, 103 based on Foata normal form. 20/885 useless extension candidates. Maximal degree in co-relation 1802. Up to 315 conditions per place. [2022-11-16 11:51:07,492 INFO L137 encePairwiseOnDemand]: 115/122 looper letters, 26 selfloop transitions, 3 changer transitions 31/139 dead transitions. [2022-11-16 11:51:07,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 454 flow [2022-11-16 11:51:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:51:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:51:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2022-11-16 11:51:07,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8131147540983606 [2022-11-16 11:51:07,497 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2022-11-16 11:51:07,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2022-11-16 11:51:07,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:07,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2022-11-16 11:51:07,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 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:51:07,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:07,511 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:07,511 INFO L175 Difference]: Start difference. First operand has 127 places, 103 transitions, 238 flow. Second operand 10 states and 992 transitions. [2022-11-16 11:51:07,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 454 flow [2022-11-16 11:51:07,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 418 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-16 11:51:07,518 INFO L231 Difference]: Finished difference. Result has 128 places, 103 transitions, 242 flow [2022-11-16 11:51:07,518 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=242, PETRI_PLACES=128, PETRI_TRANSITIONS=103} [2022-11-16 11:51:07,523 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-11-16 11:51:07,523 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 103 transitions, 242 flow [2022-11-16 11:51:07,526 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:51:07,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:07,527 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:51:07,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:51:07,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1303667889, now seen corresponding path program 1 times [2022-11-16 11:51:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168408637] [2022-11-16 11:51:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:07,888 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:51:07,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:07,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168408637] [2022-11-16 11:51:07,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168408637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:07,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:07,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:51:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681044321] [2022-11-16 11:51:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:07,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:51:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:51:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:51:07,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-11-16 11:51:07,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 103 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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:51:07,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:07,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-11-16 11:51:07,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:08,508 INFO L130 PetriNetUnfolder]: 556/1216 cut-off events. [2022-11-16 11:51:08,509 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-11-16 11:51:08,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 1216 events. 556/1216 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7964 event pairs, 25 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 2338. Up to 343 conditions per place. [2022-11-16 11:51:08,518 INFO L137 encePairwiseOnDemand]: 112/122 looper letters, 28 selfloop transitions, 6 changer transitions 45/163 dead transitions. [2022-11-16 11:51:08,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 163 transitions, 545 flow [2022-11-16 11:51:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:51:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:51:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1071 transitions. [2022-11-16 11:51:08,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8778688524590164 [2022-11-16 11:51:08,522 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1071 transitions. [2022-11-16 11:51:08,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1071 transitions. [2022-11-16 11:51:08,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:08,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1071 transitions. [2022-11-16 11:51:08,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:08,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:08,531 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:08,531 INFO L175 Difference]: Start difference. First operand has 128 places, 103 transitions, 242 flow. Second operand 10 states and 1071 transitions. [2022-11-16 11:51:08,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 163 transitions, 545 flow [2022-11-16 11:51:08,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 163 transitions, 513 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-11-16 11:51:08,536 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 278 flow [2022-11-16 11:51:08,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2022-11-16 11:51:08,541 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-11-16 11:51:08,541 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 278 flow [2022-11-16 11:51:08,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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:51:08,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:08,542 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] [2022-11-16 11:51:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:51:08,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -343156952, now seen corresponding path program 1 times [2022-11-16 11:51:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:08,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744873266] [2022-11-16 11:51:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:08,990 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:51:08,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:08,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744873266] [2022-11-16 11:51:08,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744873266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:08,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:08,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824554892] [2022-11-16 11:51:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:08,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:08,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-11-16 11:51:08,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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:51:08,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:08,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-11-16 11:51:08,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:09,493 INFO L130 PetriNetUnfolder]: 212/618 cut-off events. [2022-11-16 11:51:09,494 INFO L131 PetriNetUnfolder]: For 609/617 co-relation queries the response was YES. [2022-11-16 11:51:09,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 618 events. 212/618 cut-off events. For 609/617 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3406 event pairs, 4 based on Foata normal form. 22/638 useless extension candidates. Maximal degree in co-relation 1550. Up to 154 conditions per place. [2022-11-16 11:51:09,499 INFO L137 encePairwiseOnDemand]: 113/122 looper letters, 33 selfloop transitions, 9 changer transitions 35/161 dead transitions. [2022-11-16 11:51:09,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 684 flow [2022-11-16 11:51:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:51:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:51:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2022-11-16 11:51:09,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8762295081967213 [2022-11-16 11:51:09,504 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1069 transitions. [2022-11-16 11:51:09,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1069 transitions. [2022-11-16 11:51:09,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:09,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1069 transitions. [2022-11-16 11:51:09,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.9) internal successors, (1069), 10 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:51:09,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:09,512 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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:51:09,513 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 278 flow. Second operand 10 states and 1069 transitions. [2022-11-16 11:51:09,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 684 flow [2022-11-16 11:51:09,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 161 transitions, 660 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-16 11:51:09,520 INFO L231 Difference]: Finished difference. Result has 132 places, 108 transitions, 346 flow [2022-11-16 11:51:09,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=346, PETRI_PLACES=132, PETRI_TRANSITIONS=108} [2022-11-16 11:51:09,521 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 5 predicate places. [2022-11-16 11:51:09,521 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 108 transitions, 346 flow [2022-11-16 11:51:09,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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:51:09,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:09,522 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] [2022-11-16 11:51:09,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:51:09,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash -101679031, now seen corresponding path program 1 times [2022-11-16 11:51:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556783096] [2022-11-16 11:51:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:09,927 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:51:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556783096] [2022-11-16 11:51:09,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556783096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:09,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:09,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588302928] [2022-11-16 11:51:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:09,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:09,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 122 [2022-11-16 11:51:09,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 108 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 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:51:09,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:09,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 122 [2022-11-16 11:51:09,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:10,368 INFO L130 PetriNetUnfolder]: 126/653 cut-off events. [2022-11-16 11:51:10,369 INFO L131 PetriNetUnfolder]: For 956/1013 co-relation queries the response was YES. [2022-11-16 11:51:10,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 653 events. 126/653 cut-off events. For 956/1013 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3770 event pairs, 43 based on Foata normal form. 19/660 useless extension candidates. Maximal degree in co-relation 1556. Up to 116 conditions per place. [2022-11-16 11:51:10,375 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 33 selfloop transitions, 2 changer transitions 11/135 dead transitions. [2022-11-16 11:51:10,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 135 transitions, 505 flow [2022-11-16 11:51:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:51:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2022-11-16 11:51:10,378 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8583138173302107 [2022-11-16 11:51:10,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2022-11-16 11:51:10,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2022-11-16 11:51:10,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:10,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2022-11-16 11:51:10,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 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:51:10,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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:51:10,385 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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:51:10,385 INFO L175 Difference]: Start difference. First operand has 132 places, 108 transitions, 346 flow. Second operand 7 states and 733 transitions. [2022-11-16 11:51:10,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 135 transitions, 505 flow [2022-11-16 11:51:10,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 135 transitions, 449 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-16 11:51:10,395 INFO L231 Difference]: Finished difference. Result has 130 places, 109 transitions, 309 flow [2022-11-16 11:51:10,396 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2022-11-16 11:51:10,397 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 3 predicate places. [2022-11-16 11:51:10,397 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 309 flow [2022-11-16 11:51:10,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 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:51:10,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:10,398 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] [2022-11-16 11:51:10,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:51:10,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1954517553, now seen corresponding path program 2 times [2022-11-16 11:51:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:10,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398621875] [2022-11-16 11:51:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:10,836 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:51:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:10,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398621875] [2022-11-16 11:51:10,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398621875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:10,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:10,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:51:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847982673] [2022-11-16 11:51:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:10,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:51:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:51:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:51:10,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-11-16 11:51:10,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 109 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 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:51:10,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:10,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-11-16 11:51:10,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:11,299 INFO L130 PetriNetUnfolder]: 129/494 cut-off events. [2022-11-16 11:51:11,300 INFO L131 PetriNetUnfolder]: For 361/367 co-relation queries the response was YES. [2022-11-16 11:51:11,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 494 events. 129/494 cut-off events. For 361/367 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2596 event pairs, 8 based on Foata normal form. 20/499 useless extension candidates. Maximal degree in co-relation 1137. Up to 83 conditions per place. [2022-11-16 11:51:11,303 INFO L137 encePairwiseOnDemand]: 113/122 looper letters, 23 selfloop transitions, 12 changer transitions 22/141 dead transitions. [2022-11-16 11:51:11,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 141 transitions, 556 flow [2022-11-16 11:51:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:51:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:51:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1147 transitions. [2022-11-16 11:51:11,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8546944858420268 [2022-11-16 11:51:11,308 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1147 transitions. [2022-11-16 11:51:11,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1147 transitions. [2022-11-16 11:51:11,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:11,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1147 transitions. [2022-11-16 11:51:11,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 104.27272727272727) internal successors, (1147), 11 states have internal predecessors, (1147), 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:51:11,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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:51:11,316 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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:51:11,316 INFO L175 Difference]: Start difference. First operand has 130 places, 109 transitions, 309 flow. Second operand 11 states and 1147 transitions. [2022-11-16 11:51:11,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 141 transitions, 556 flow [2022-11-16 11:51:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 141 transitions, 515 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-11-16 11:51:11,322 INFO L231 Difference]: Finished difference. Result has 136 places, 108 transitions, 324 flow [2022-11-16 11:51:11,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2022-11-16 11:51:11,323 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2022-11-16 11:51:11,324 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 324 flow [2022-11-16 11:51:11,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 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:51:11,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:11,325 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] [2022-11-16 11:51:11,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:51:11,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash -635098305, now seen corresponding path program 1 times [2022-11-16 11:51:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:11,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514769540] [2022-11-16 11:51:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:11,795 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:51:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514769540] [2022-11-16 11:51:11,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514769540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:11,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:11,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933431977] [2022-11-16 11:51:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:11,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-11-16 11:51:11,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 108 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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:51:11,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:11,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-11-16 11:51:11,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:12,128 INFO L130 PetriNetUnfolder]: 44/306 cut-off events. [2022-11-16 11:51:12,131 INFO L131 PetriNetUnfolder]: For 176/186 co-relation queries the response was YES. [2022-11-16 11:51:12,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 306 events. 44/306 cut-off events. For 176/186 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1179 event pairs, 11 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 575. Up to 44 conditions per place. [2022-11-16 11:51:12,133 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 18 selfloop transitions, 1 changer transitions 13/122 dead transitions. [2022-11-16 11:51:12,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 122 transitions, 422 flow [2022-11-16 11:51:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:51:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2022-11-16 11:51:12,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8501170960187353 [2022-11-16 11:51:12,138 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2022-11-16 11:51:12,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2022-11-16 11:51:12,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:12,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2022-11-16 11:51:12,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 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:51:12,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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:51:12,145 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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:51:12,145 INFO L175 Difference]: Start difference. First operand has 136 places, 108 transitions, 324 flow. Second operand 7 states and 726 transitions. [2022-11-16 11:51:12,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 122 transitions, 422 flow [2022-11-16 11:51:12,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 342 flow, removed 21 selfloop flow, removed 16 redundant places. [2022-11-16 11:51:12,151 INFO L231 Difference]: Finished difference. Result has 126 places, 108 transitions, 259 flow [2022-11-16 11:51:12,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=126, PETRI_TRANSITIONS=108} [2022-11-16 11:51:12,153 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2022-11-16 11:51:12,153 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 108 transitions, 259 flow [2022-11-16 11:51:12,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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:51:12,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:12,155 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] [2022-11-16 11:51:12,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:51:12,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:12,156 INFO L85 PathProgramCache]: Analyzing trace with hash 39208461, now seen corresponding path program 2 times [2022-11-16 11:51:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:12,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273829561] [2022-11-16 11:51:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:12,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:14,324 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:51:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:14,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273829561] [2022-11-16 11:51:14,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273829561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:14,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:14,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:51:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236026644] [2022-11-16 11:51:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:51:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:51:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:51:14,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2022-11-16 11:51:14,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 108 transitions, 259 flow. Second operand has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:51:14,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:51:14,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2022-11-16 11:51:14,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:51:14,675 INFO L130 PetriNetUnfolder]: 20/222 cut-off events. [2022-11-16 11:51:14,675 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-16 11:51:14,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 222 events. 20/222 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 630 event pairs, 2 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 329. Up to 20 conditions per place. [2022-11-16 11:51:14,677 INFO L137 encePairwiseOnDemand]: 111/122 looper letters, 16 selfloop transitions, 6 changer transitions 8/116 dead transitions. [2022-11-16 11:51:14,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 116 transitions, 341 flow [2022-11-16 11:51:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:51:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 11:51:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1171 transitions. [2022-11-16 11:51:14,682 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.799863387978142 [2022-11-16 11:51:14,682 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1171 transitions. [2022-11-16 11:51:14,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1171 transitions. [2022-11-16 11:51:14,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:14,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1171 transitions. [2022-11-16 11:51:14,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 97.58333333333333) internal successors, (1171), 12 states have internal predecessors, (1171), 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:51:14,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 122.0) internal successors, (1586), 13 states have internal predecessors, (1586), 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:51:14,692 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 122.0) internal successors, (1586), 13 states have internal predecessors, (1586), 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:51:14,692 INFO L175 Difference]: Start difference. First operand has 126 places, 108 transitions, 259 flow. Second operand 12 states and 1171 transitions. [2022-11-16 11:51:14,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 116 transitions, 341 flow [2022-11-16 11:51:14,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 116 transitions, 326 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-16 11:51:14,696 INFO L231 Difference]: Finished difference. Result has 133 places, 108 transitions, 274 flow [2022-11-16 11:51:14,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=274, PETRI_PLACES=133, PETRI_TRANSITIONS=108} [2022-11-16 11:51:14,697 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 6 predicate places. [2022-11-16 11:51:14,697 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 108 transitions, 274 flow [2022-11-16 11:51:14,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:51:14,698 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:51:14,699 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] [2022-11-16 11:51:14,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:51:14,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:51:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1741187233, now seen corresponding path program 3 times [2022-11-16 11:51:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:14,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792062902] [2022-11-16 11:51:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:14,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:51:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:14,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:51:14,897 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:51:14,898 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:51:14,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:51:14,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:51:14,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:51:14,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:51:14,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:51:14,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:51:14,903 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:14,914 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:51:14,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:51:15,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:51:15 BasicIcfg [2022-11-16 11:51:15,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:51:15,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:51:15,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:51:15,073 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:51:15,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:01" (3/4) ... [2022-11-16 11:51:15,076 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:51:15,311 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:51:15,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:51:15,312 INFO L158 Benchmark]: Toolchain (without parser) took 15460.69ms. Allocated memory was 104.9MB in the beginning and 295.7MB in the end (delta: 190.8MB). Free memory was 59.2MB in the beginning and 262.0MB in the end (delta: -202.9MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,312 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:51:15,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 863.26ms. Allocated memory is still 104.9MB. Free memory was 59.0MB in the beginning and 65.3MB in the end (delta: -6.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.98ms. Allocated memory is still 104.9MB. Free memory was 65.1MB in the beginning and 62.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,314 INFO L158 Benchmark]: Boogie Preprocessor took 45.03ms. Allocated memory is still 104.9MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,315 INFO L158 Benchmark]: RCFGBuilder took 1125.23ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 60.4MB in the beginning and 92.7MB in the end (delta: -32.3MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,315 INFO L158 Benchmark]: TraceAbstraction took 13101.14ms. Allocated memory was 136.3MB in the beginning and 245.4MB in the end (delta: 109.1MB). Free memory was 91.8MB in the beginning and 95.5MB in the end (delta: -3.7MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,316 INFO L158 Benchmark]: Witness Printer took 238.73ms. Allocated memory was 245.4MB in the beginning and 295.7MB in the end (delta: 50.3MB). Free memory was 95.5MB in the beginning and 262.0MB in the end (delta: -166.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-16 11:51:15,319 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.35ms. Allocated memory is still 104.9MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 863.26ms. Allocated memory is still 104.9MB. Free memory was 59.0MB in the beginning and 65.3MB in the end (delta: -6.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.98ms. Allocated memory is still 104.9MB. Free memory was 65.1MB in the beginning and 62.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.03ms. Allocated memory is still 104.9MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1125.23ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 60.4MB in the beginning and 92.7MB in the end (delta: -32.3MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13101.14ms. Allocated memory was 136.3MB in the beginning and 245.4MB in the end (delta: 109.1MB). Free memory was 91.8MB in the beginning and 95.5MB in the end (delta: -3.7MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 238.73ms. Allocated memory was 245.4MB in the beginning and 295.7MB in the end (delta: 50.3MB). Free memory was 95.5MB in the beginning and 262.0MB in the end (delta: -166.5MB). 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] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L746] 0 int z$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L732] 0 _Bool z$flush_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L744] 0 int z$w_buff0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L735] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L736] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L734] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L737] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 int z$mem_tmp; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L742] 0 _Bool z$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L723] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=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, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L743] 0 int *z$read_delayed_var; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L747] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=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, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=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, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 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, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool z$w_buff0_used; 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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L727] 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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t41; 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, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t41, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-2, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t42; 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t42, ((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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-1, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t43; 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] FCALL, FORK 0 pthread_create(&t43, ((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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 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, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 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, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 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, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 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, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 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, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] 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, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=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, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 861]: 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: 859]: 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, 151 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: 12.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1103 IncrementalHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 113 mSDtfsCounter, 1103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=6, InterpolantAutomatonStates: 89, 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.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 966 NumberOfCodeBlocks, 966 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 3627 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:51:15,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00d44d4a-24a6-45af-a860-d598ea1085ca/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE