./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD --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 d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:19:20,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:19:20,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:19:20,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:19:20,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:19:20,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:19:20,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:19:20,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:19:20,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:19:20,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:19:20,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:19:20,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:19:20,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:19:20,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:19:20,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:19:20,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:19:20,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:19:20,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:19:20,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:19:20,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:19:20,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:19:20,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:19:20,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:19:20,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:19:20,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:19:20,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:19:20,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:19:20,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:19:20,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:19:20,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:19:20,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:19:20,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:19:20,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:19:20,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:19:20,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:19:20,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:19:20,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:19:20,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:19:20,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:19:20,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:19:20,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:19:20,480 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:19:20,525 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:19:20,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:19:20,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:19:20,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:19:20,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:19:20,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:19:20,528 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:19:20,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:19:20,529 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:19:20,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:19:20,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:19:20,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:19:20,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:19:20,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:19:20,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:19:20,531 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:19:20,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:19:20,532 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:19:20,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:19:20,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:19:20,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:19:20,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:19:20,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:19:20,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:19:20,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:19:20,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:19:20,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:19:20,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:19:20,535 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:19:20,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:19:20,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:19:20,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:19:20,537 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_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/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_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2021-10-28 23:19:20,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:19:20,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:19:20,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:19:20,818 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:19:20,819 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:19:20,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2021-10-28 23:19:20,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/data/e65b9c6ed/21967c3c22354855842b0b778a79fbe9/FLAG0583fc5bb [2021-10-28 23:19:21,481 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:19:21,482 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2021-10-28 23:19:21,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/data/e65b9c6ed/21967c3c22354855842b0b778a79fbe9/FLAG0583fc5bb [2021-10-28 23:19:21,738 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/data/e65b9c6ed/21967c3c22354855842b0b778a79fbe9 [2021-10-28 23:19:21,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:19:21,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:19:21,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:19:21,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:19:21,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:19:21,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:19:21" (1/1) ... [2021-10-28 23:19:21,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420811a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:21, skipping insertion in model container [2021-10-28 23:19:21,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:19:21" (1/1) ... [2021-10-28 23:19:21,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:19:21,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:19:22,032 WARN L228 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_b05af539-3d5a-4e9b-a47c-6f370f033243/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2021-10-28 23:19:22,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:19:22,385 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:19:22,408 WARN L228 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_b05af539-3d5a-4e9b-a47c-6f370f033243/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2021-10-28 23:19:22,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:19:22,547 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:19:22,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22 WrapperNode [2021-10-28 23:19:22,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:19:22,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:19:22,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:19:22,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:19:22,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:19:22,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:19:22,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:19:22,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:19:22,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:19:22,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:19:22,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:19:22,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:19:22,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (1/1) ... [2021-10-28 23:19:22,708 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:19:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:19:22,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:19:22,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:19:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 23:19:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 23:19:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:19:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 23:19:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 23:19:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 23:19:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 23:19:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 23:19:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 23:19:22,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 23:19:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:19:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 23:19:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:19:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:19:22,826 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 23:19:25,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:19:25,069 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 23:19:25,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:19:25 BoogieIcfgContainer [2021-10-28 23:19:25,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:19:25,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:19:25,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:19:25,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:19:25,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:19:21" (1/3) ... [2021-10-28 23:19:25,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392de56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:19:25, skipping insertion in model container [2021-10-28 23:19:25,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:19:22" (2/3) ... [2021-10-28 23:19:25,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392de56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:19:25, skipping insertion in model container [2021-10-28 23:19:25,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:19:25" (3/3) ... [2021-10-28 23:19:25,085 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2021-10-28 23:19:25,092 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 23:19:25,093 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:19:25,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 23:19:25,093 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 23:19:25,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,165 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,165 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,174 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,174 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,176 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,176 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,205 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,216 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,218 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,218 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 23:19:25,222 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 23:19:25,273 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:19:25,280 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:19:25,280 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-28 23:19:25,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2021-10-28 23:19:25,336 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2021-10-28 23:19:25,336 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 23:19:25,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-10-28 23:19:25,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2021-10-28 23:19:25,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2021-10-28 23:19:25,358 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2021-10-28 23:19:25,359 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 23:19:25,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:25,360 INFO L254 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] [2021-10-28 23:19:25,360 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -729574034, now seen corresponding path program 1 times [2021-10-28 23:19:25,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:25,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512901797] [2021-10-28 23:19:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:25,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:25,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:25,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512901797] [2021-10-28 23:19:25,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512901797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:25,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:25,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:19:25,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410340129] [2021-10-28 23:19:25,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:19:25,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:25,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:19:25,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:19:25,692 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 109 [2021-10-28 23:19:25,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2021-10-28 23:19:25,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:25,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 109 [2021-10-28 23:19:25,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:25,937 INFO L129 PetriNetUnfolder]: 49/391 cut-off events. [2021-10-28 23:19:25,937 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 23:19:25,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 391 events. 49/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1926 event pairs, 27 based on Foata normal form. 18/385 useless extension candidates. Maximal degree in co-relation 438. Up to 65 conditions per place. [2021-10-28 23:19:25,943 INFO L132 encePairwiseOnDemand]: 104/109 looper letters, 9 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2021-10-28 23:19:25,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 243 flow [2021-10-28 23:19:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:19:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 23:19:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2021-10-28 23:19:25,962 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2021-10-28 23:19:25,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2021-10-28 23:19:25,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2021-10-28 23:19:25,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:25,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2021-10-28 23:19:25,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:19:25,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2021-10-28 23:19:25,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2021-10-28 23:19:25,984 INFO L186 Difference]: Start difference. First operand has 114 places, 106 transitions, 221 flow. Second operand 3 states and 310 transitions. [2021-10-28 23:19:25,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 243 flow [2021-10-28 23:19:25,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-28 23:19:25,999 INFO L242 Difference]: Finished difference. Result has 111 places, 102 transitions, 214 flow [2021-10-28 23:19:26,001 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2021-10-28 23:19:26,002 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2021-10-28 23:19:26,003 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 214 flow [2021-10-28 23:19:26,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2021-10-28 23:19:26,004 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:26,004 INFO L254 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] [2021-10-28 23:19:26,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:19:26,005 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2016018029, now seen corresponding path program 1 times [2021-10-28 23:19:26,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:26,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523550649] [2021-10-28 23:19:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:26,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:26,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:26,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523550649] [2021-10-28 23:19:26,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523550649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:26,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:26,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:19:26,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290724910] [2021-10-28 23:19:26,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:19:26,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:19:26,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:19:26,381 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 109 [2021-10-28 23:19:26,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2021-10-28 23:19:26,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:26,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 109 [2021-10-28 23:19:26,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:26,548 INFO L129 PetriNetUnfolder]: 4/139 cut-off events. [2021-10-28 23:19:26,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 23:19:26,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 139 events. 4/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2021-10-28 23:19:26,551 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 6 selfloop transitions, 2 changer transitions 23/114 dead transitions. [2021-10-28 23:19:26,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 114 transitions, 280 flow [2021-10-28 23:19:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:19:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 23:19:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2021-10-28 23:19:26,565 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9133537206931702 [2021-10-28 23:19:26,565 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2021-10-28 23:19:26,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2021-10-28 23:19:26,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:26,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2021-10-28 23:19:26,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 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) [2021-10-28 23:19:26,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 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) [2021-10-28 23:19:26,578 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 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) [2021-10-28 23:19:26,579 INFO L186 Difference]: Start difference. First operand has 111 places, 102 transitions, 214 flow. Second operand 9 states and 896 transitions. [2021-10-28 23:19:26,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 114 transitions, 280 flow [2021-10-28 23:19:26,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 23:19:26,591 INFO L242 Difference]: Finished difference. Result has 124 places, 91 transitions, 208 flow [2021-10-28 23:19:26,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=124, PETRI_TRANSITIONS=91} [2021-10-28 23:19:26,592 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 10 predicate places. [2021-10-28 23:19:26,593 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 91 transitions, 208 flow [2021-10-28 23:19:26,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2021-10-28 23:19:26,593 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:26,594 INFO L254 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] [2021-10-28 23:19:26,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:19:26,594 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -870310748, now seen corresponding path program 1 times [2021-10-28 23:19:26,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:26,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890918814] [2021-10-28 23:19:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:26,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:27,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:27,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890918814] [2021-10-28 23:19:27,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890918814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:27,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:27,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 23:19:27,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092500364] [2021-10-28 23:19:27,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 23:19:27,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 23:19:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:19:27,116 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2021-10-28 23:19:27,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 91 transitions, 208 flow. Second operand has 11 states, 11 states have (on average 88.0909090909091) internal successors, (969), 11 states have internal predecessors, (969), 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) [2021-10-28 23:19:27,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:27,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2021-10-28 23:19:27,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:27,983 INFO L129 PetriNetUnfolder]: 302/693 cut-off events. [2021-10-28 23:19:27,983 INFO L130 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2021-10-28 23:19:27,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 693 events. 302/693 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3697 event pairs, 81 based on Foata normal form. 19/695 useless extension candidates. Maximal degree in co-relation 1333. Up to 281 conditions per place. [2021-10-28 23:19:27,998 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 15 selfloop transitions, 10 changer transitions 44/143 dead transitions. [2021-10-28 23:19:27,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 143 transitions, 478 flow [2021-10-28 23:19:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 23:19:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-28 23:19:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1551 transitions. [2021-10-28 23:19:28,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8370210469508904 [2021-10-28 23:19:28,006 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1551 transitions. [2021-10-28 23:19:28,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1551 transitions. [2021-10-28 23:19:28,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:28,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1551 transitions. [2021-10-28 23:19:28,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 91.23529411764706) internal successors, (1551), 17 states have internal predecessors, (1551), 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) [2021-10-28 23:19:28,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 109.0) internal successors, (1962), 18 states have internal predecessors, (1962), 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) [2021-10-28 23:19:28,026 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 109.0) internal successors, (1962), 18 states have internal predecessors, (1962), 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) [2021-10-28 23:19:28,026 INFO L186 Difference]: Start difference. First operand has 124 places, 91 transitions, 208 flow. Second operand 17 states and 1551 transitions. [2021-10-28 23:19:28,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 143 transitions, 478 flow [2021-10-28 23:19:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 143 transitions, 438 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-10-28 23:19:28,050 INFO L242 Difference]: Finished difference. Result has 126 places, 96 transitions, 277 flow [2021-10-28 23:19:28,050 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=277, PETRI_PLACES=126, PETRI_TRANSITIONS=96} [2021-10-28 23:19:28,051 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 12 predicate places. [2021-10-28 23:19:28,051 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 96 transitions, 277 flow [2021-10-28 23:19:28,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.0909090909091) internal successors, (969), 11 states have internal predecessors, (969), 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) [2021-10-28 23:19:28,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:28,053 INFO L254 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] [2021-10-28 23:19:28,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:19:28,054 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash -49712036, now seen corresponding path program 1 times [2021-10-28 23:19:28,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:28,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399703685] [2021-10-28 23:19:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:28,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:28,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:28,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399703685] [2021-10-28 23:19:28,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399703685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:28,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:28,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:19:28,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826180496] [2021-10-28 23:19:28,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:19:28,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:19:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:19:28,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 109 [2021-10-28 23:19:28,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 96 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 91.22222222222223) internal successors, (821), 9 states have internal predecessors, (821), 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) [2021-10-28 23:19:28,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:28,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 109 [2021-10-28 23:19:28,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:29,130 INFO L129 PetriNetUnfolder]: 277/736 cut-off events. [2021-10-28 23:19:29,130 INFO L130 PetriNetUnfolder]: For 1767/1868 co-relation queries the response was YES. [2021-10-28 23:19:29,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 736 events. 277/736 cut-off events. For 1767/1868 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4180 event pairs, 53 based on Foata normal form. 18/736 useless extension candidates. Maximal degree in co-relation 2232. Up to 254 conditions per place. [2021-10-28 23:19:29,142 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 21 selfloop transitions, 8 changer transitions 31/136 dead transitions. [2021-10-28 23:19:29,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 693 flow [2021-10-28 23:19:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 23:19:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 23:19:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1047 transitions. [2021-10-28 23:19:29,147 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8732276897414513 [2021-10-28 23:19:29,148 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1047 transitions. [2021-10-28 23:19:29,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1047 transitions. [2021-10-28 23:19:29,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:29,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1047 transitions. [2021-10-28 23:19:29,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.18181818181819) internal successors, (1047), 11 states have internal predecessors, (1047), 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) [2021-10-28 23:19:29,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 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) [2021-10-28 23:19:29,159 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 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) [2021-10-28 23:19:29,160 INFO L186 Difference]: Start difference. First operand has 126 places, 96 transitions, 277 flow. Second operand 11 states and 1047 transitions. [2021-10-28 23:19:29,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 693 flow [2021-10-28 23:19:29,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 665 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-10-28 23:19:29,169 INFO L242 Difference]: Finished difference. Result has 127 places, 99 transitions, 345 flow [2021-10-28 23:19:29,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=345, PETRI_PLACES=127, PETRI_TRANSITIONS=99} [2021-10-28 23:19:29,171 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2021-10-28 23:19:29,171 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 99 transitions, 345 flow [2021-10-28 23:19:29,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.22222222222223) internal successors, (821), 9 states have internal predecessors, (821), 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) [2021-10-28 23:19:29,172 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:29,172 INFO L254 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] [2021-10-28 23:19:29,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:19:29,173 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:29,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1169433508, now seen corresponding path program 1 times [2021-10-28 23:19:29,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:29,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427086863] [2021-10-28 23:19:29,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:29,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:29,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:29,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427086863] [2021-10-28 23:19:29,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427086863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:29,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:29,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 23:19:29,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026478686] [2021-10-28 23:19:29,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 23:19:29,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:29,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 23:19:29,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:19:29,693 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2021-10-28 23:19:29,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 99 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 86.14285714285714) internal successors, (1206), 14 states have internal predecessors, (1206), 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) [2021-10-28 23:19:29,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:29,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2021-10-28 23:19:29,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:30,512 INFO L129 PetriNetUnfolder]: 197/537 cut-off events. [2021-10-28 23:19:30,512 INFO L130 PetriNetUnfolder]: For 3395/3644 co-relation queries the response was YES. [2021-10-28 23:19:30,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 537 events. 197/537 cut-off events. For 3395/3644 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2716 event pairs, 58 based on Foata normal form. 12/534 useless extension candidates. Maximal degree in co-relation 2288. Up to 254 conditions per place. [2021-10-28 23:19:30,525 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 28 selfloop transitions, 12 changer transitions 25/137 dead transitions. [2021-10-28 23:19:30,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 893 flow [2021-10-28 23:19:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 23:19:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-28 23:19:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1590 transitions. [2021-10-28 23:19:30,533 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8103975535168195 [2021-10-28 23:19:30,533 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1590 transitions. [2021-10-28 23:19:30,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1590 transitions. [2021-10-28 23:19:30,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:30,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1590 transitions. [2021-10-28 23:19:30,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 88.33333333333333) internal successors, (1590), 18 states have internal predecessors, (1590), 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) [2021-10-28 23:19:30,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 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) [2021-10-28 23:19:30,551 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 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) [2021-10-28 23:19:30,551 INFO L186 Difference]: Start difference. First operand has 127 places, 99 transitions, 345 flow. Second operand 18 states and 1590 transitions. [2021-10-28 23:19:30,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 893 flow [2021-10-28 23:19:30,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 851 flow, removed 15 selfloop flow, removed 6 redundant places. [2021-10-28 23:19:30,565 INFO L242 Difference]: Finished difference. Result has 142 places, 102 transitions, 421 flow [2021-10-28 23:19:30,566 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=421, PETRI_PLACES=142, PETRI_TRANSITIONS=102} [2021-10-28 23:19:30,566 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 28 predicate places. [2021-10-28 23:19:30,566 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 102 transitions, 421 flow [2021-10-28 23:19:30,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.14285714285714) internal successors, (1206), 14 states have internal predecessors, (1206), 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) [2021-10-28 23:19:30,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:30,568 INFO L254 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] [2021-10-28 23:19:30,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:19:30,569 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash 805187271, now seen corresponding path program 1 times [2021-10-28 23:19:30,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:30,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015727879] [2021-10-28 23:19:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:30,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:30,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:30,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015727879] [2021-10-28 23:19:30,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015727879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:30,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:30,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:19:30,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651591144] [2021-10-28 23:19:30,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:19:30,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:19:30,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:19:30,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2021-10-28 23:19:30,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 102 transitions, 421 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) [2021-10-28 23:19:30,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:30,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2021-10-28 23:19:30,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:31,029 INFO L129 PetriNetUnfolder]: 201/670 cut-off events. [2021-10-28 23:19:31,029 INFO L130 PetriNetUnfolder]: For 5996/6401 co-relation queries the response was YES. [2021-10-28 23:19:31,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 670 events. 201/670 cut-off events. For 5996/6401 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4113 event pairs, 57 based on Foata normal form. 23/674 useless extension candidates. Maximal degree in co-relation 2991. Up to 225 conditions per place. [2021-10-28 23:19:31,065 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 15 selfloop transitions, 2 changer transitions 4/112 dead transitions. [2021-10-28 23:19:31,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 112 transitions, 554 flow [2021-10-28 23:19:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:19:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-28 23:19:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2021-10-28 23:19:31,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.891218872870249 [2021-10-28 23:19:31,070 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2021-10-28 23:19:31,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2021-10-28 23:19:31,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:31,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2021-10-28 23:19:31,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:19:31,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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) [2021-10-28 23:19:31,077 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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) [2021-10-28 23:19:31,078 INFO L186 Difference]: Start difference. First operand has 142 places, 102 transitions, 421 flow. Second operand 7 states and 680 transitions. [2021-10-28 23:19:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 112 transitions, 554 flow [2021-10-28 23:19:31,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 112 transitions, 458 flow, removed 41 selfloop flow, removed 15 redundant places. [2021-10-28 23:19:31,100 INFO L242 Difference]: Finished difference. Result has 129 places, 103 transitions, 374 flow [2021-10-28 23:19:31,100 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=129, PETRI_TRANSITIONS=103} [2021-10-28 23:19:31,101 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 15 predicate places. [2021-10-28 23:19:31,101 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 103 transitions, 374 flow [2021-10-28 23:19:31,102 INFO L471 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) [2021-10-28 23:19:31,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:31,102 INFO L254 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] [2021-10-28 23:19:31,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:19:31,104 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1778370199, now seen corresponding path program 2 times [2021-10-28 23:19:31,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:31,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225416145] [2021-10-28 23:19:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:31,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:31,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:31,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225416145] [2021-10-28 23:19:31,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225416145] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:31,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:31,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:19:31,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732355611] [2021-10-28 23:19:31,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:19:31,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:19:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:19:31,325 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-10-28 23:19:31,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 103 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-10-28 23:19:31,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:31,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-10-28 23:19:31,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:31,833 INFO L129 PetriNetUnfolder]: 559/1673 cut-off events. [2021-10-28 23:19:31,834 INFO L130 PetriNetUnfolder]: For 4163/4292 co-relation queries the response was YES. [2021-10-28 23:19:31,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 1673 events. 559/1673 cut-off events. For 4163/4292 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 14227 event pairs, 141 based on Foata normal form. 55/1622 useless extension candidates. Maximal degree in co-relation 4369. Up to 381 conditions per place. [2021-10-28 23:19:31,864 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 19 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2021-10-28 23:19:31,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 128 transitions, 494 flow [2021-10-28 23:19:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:19:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 23:19:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2021-10-28 23:19:31,870 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.90927624872579 [2021-10-28 23:19:31,870 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2021-10-28 23:19:31,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2021-10-28 23:19:31,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:31,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2021-10-28 23:19:31,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 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) [2021-10-28 23:19:31,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 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) [2021-10-28 23:19:31,881 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 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) [2021-10-28 23:19:31,881 INFO L186 Difference]: Start difference. First operand has 129 places, 103 transitions, 374 flow. Second operand 9 states and 892 transitions. [2021-10-28 23:19:31,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 128 transitions, 494 flow [2021-10-28 23:19:31,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 487 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-10-28 23:19:31,896 INFO L242 Difference]: Finished difference. Result has 135 places, 117 transitions, 478 flow [2021-10-28 23:19:31,897 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=478, PETRI_PLACES=135, PETRI_TRANSITIONS=117} [2021-10-28 23:19:31,897 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 21 predicate places. [2021-10-28 23:19:31,898 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 117 transitions, 478 flow [2021-10-28 23:19:31,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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) [2021-10-28 23:19:31,899 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:31,899 INFO L254 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] [2021-10-28 23:19:31,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:19:31,900 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1211214408, now seen corresponding path program 1 times [2021-10-28 23:19:31,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:31,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788706713] [2021-10-28 23:19:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:31,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:32,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:32,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788706713] [2021-10-28 23:19:32,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788706713] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:32,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:32,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:19:32,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983826029] [2021-10-28 23:19:32,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:19:32,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:19:32,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:19:32,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-10-28 23:19:32,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 117 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 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) [2021-10-28 23:19:32,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:32,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-10-28 23:19:32,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:32,556 INFO L129 PetriNetUnfolder]: 408/1348 cut-off events. [2021-10-28 23:19:32,556 INFO L130 PetriNetUnfolder]: For 3514/4517 co-relation queries the response was YES. [2021-10-28 23:19:32,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1348 events. 408/1348 cut-off events. For 3514/4517 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 11580 event pairs, 16 based on Foata normal form. 273/1525 useless extension candidates. Maximal degree in co-relation 4289. Up to 386 conditions per place. [2021-10-28 23:19:32,577 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 15 selfloop transitions, 31 changer transitions 6/145 dead transitions. [2021-10-28 23:19:32,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 145 transitions, 763 flow [2021-10-28 23:19:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 23:19:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-28 23:19:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1190 transitions. [2021-10-28 23:19:32,582 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9097859327217125 [2021-10-28 23:19:32,583 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1190 transitions. [2021-10-28 23:19:32,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1190 transitions. [2021-10-28 23:19:32,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:32,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1190 transitions. [2021-10-28 23:19:32,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 99.16666666666667) internal successors, (1190), 12 states have internal predecessors, (1190), 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) [2021-10-28 23:19:32,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 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) [2021-10-28 23:19:32,593 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 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) [2021-10-28 23:19:32,593 INFO L186 Difference]: Start difference. First operand has 135 places, 117 transitions, 478 flow. Second operand 12 states and 1190 transitions. [2021-10-28 23:19:32,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 145 transitions, 763 flow [2021-10-28 23:19:32,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-28 23:19:32,604 INFO L242 Difference]: Finished difference. Result has 148 places, 136 transitions, 706 flow [2021-10-28 23:19:32,604 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=706, PETRI_PLACES=148, PETRI_TRANSITIONS=136} [2021-10-28 23:19:32,605 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 34 predicate places. [2021-10-28 23:19:32,605 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 136 transitions, 706 flow [2021-10-28 23:19:32,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 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) [2021-10-28 23:19:32,605 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:32,606 INFO L254 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] [2021-10-28 23:19:32,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:19:32,606 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1772863739, now seen corresponding path program 1 times [2021-10-28 23:19:32,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:32,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044574218] [2021-10-28 23:19:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:32,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:32,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:32,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044574218] [2021-10-28 23:19:32,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044574218] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:32,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:32,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:19:32,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083836199] [2021-10-28 23:19:32,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:19:32,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:19:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:19:32,743 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-10-28 23:19:32,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 136 transitions, 706 flow. Second operand has 7 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 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) [2021-10-28 23:19:32,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:32,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-10-28 23:19:32,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:33,243 INFO L129 PetriNetUnfolder]: 579/2213 cut-off events. [2021-10-28 23:19:33,243 INFO L130 PetriNetUnfolder]: For 7597/7966 co-relation queries the response was YES. [2021-10-28 23:19:33,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7476 conditions, 2213 events. 579/2213 cut-off events. For 7597/7966 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 22420 event pairs, 29 based on Foata normal form. 17/2110 useless extension candidates. Maximal degree in co-relation 7396. Up to 577 conditions per place. [2021-10-28 23:19:33,278 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 18 selfloop transitions, 2 changer transitions 4/150 dead transitions. [2021-10-28 23:19:33,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 150 transitions, 854 flow [2021-10-28 23:19:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:19:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-28 23:19:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2021-10-28 23:19:33,281 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9043250327653998 [2021-10-28 23:19:33,281 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2021-10-28 23:19:33,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2021-10-28 23:19:33,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:33,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2021-10-28 23:19:33,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 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) [2021-10-28 23:19:33,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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) [2021-10-28 23:19:33,288 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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) [2021-10-28 23:19:33,288 INFO L186 Difference]: Start difference. First operand has 148 places, 136 transitions, 706 flow. Second operand 7 states and 690 transitions. [2021-10-28 23:19:33,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 150 transitions, 854 flow [2021-10-28 23:19:33,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 150 transitions, 740 flow, removed 44 selfloop flow, removed 6 redundant places. [2021-10-28 23:19:33,377 INFO L242 Difference]: Finished difference. Result has 153 places, 137 transitions, 611 flow [2021-10-28 23:19:33,378 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=153, PETRI_TRANSITIONS=137} [2021-10-28 23:19:33,378 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 39 predicate places. [2021-10-28 23:19:33,378 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 137 transitions, 611 flow [2021-10-28 23:19:33,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 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) [2021-10-28 23:19:33,379 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:33,379 INFO L254 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] [2021-10-28 23:19:33,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:19:33,380 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash 6681655, now seen corresponding path program 2 times [2021-10-28 23:19:33,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:33,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766019187] [2021-10-28 23:19:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:33,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:33,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:33,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766019187] [2021-10-28 23:19:33,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766019187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:33,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:33,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 23:19:33,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119598632] [2021-10-28 23:19:33,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 23:19:33,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 23:19:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:19:33,808 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 109 [2021-10-28 23:19:33,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 611 flow. Second operand has 14 states, 14 states have (on average 87.14285714285714) internal successors, (1220), 14 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) [2021-10-28 23:19:33,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:33,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 109 [2021-10-28 23:19:33,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:34,625 INFO L129 PetriNetUnfolder]: 572/2104 cut-off events. [2021-10-28 23:19:34,625 INFO L130 PetriNetUnfolder]: For 4643/4789 co-relation queries the response was YES. [2021-10-28 23:19:34,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 2104 events. 572/2104 cut-off events. For 4643/4789 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 21130 event pairs, 34 based on Foata normal form. 20/1994 useless extension candidates. Maximal degree in co-relation 5753. Up to 273 conditions per place. [2021-10-28 23:19:34,669 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 24 selfloop transitions, 9 changer transitions 13/154 dead transitions. [2021-10-28 23:19:34,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 154 transitions, 886 flow [2021-10-28 23:19:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:19:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 23:19:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1243 transitions. [2021-10-28 23:19:34,677 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8145478374836173 [2021-10-28 23:19:34,677 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1243 transitions. [2021-10-28 23:19:34,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1243 transitions. [2021-10-28 23:19:34,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:34,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1243 transitions. [2021-10-28 23:19:34,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.78571428571429) internal successors, (1243), 14 states have internal predecessors, (1243), 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) [2021-10-28 23:19:34,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 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) [2021-10-28 23:19:34,693 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 109.0) internal successors, (1635), 15 states have internal predecessors, (1635), 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) [2021-10-28 23:19:34,693 INFO L186 Difference]: Start difference. First operand has 153 places, 137 transitions, 611 flow. Second operand 14 states and 1243 transitions. [2021-10-28 23:19:34,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 154 transitions, 886 flow [2021-10-28 23:19:34,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 154 transitions, 863 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-10-28 23:19:34,734 INFO L242 Difference]: Finished difference. Result has 166 places, 137 transitions, 637 flow [2021-10-28 23:19:34,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=637, PETRI_PLACES=166, PETRI_TRANSITIONS=137} [2021-10-28 23:19:34,736 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2021-10-28 23:19:34,736 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 137 transitions, 637 flow [2021-10-28 23:19:34,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.14285714285714) internal successors, (1220), 14 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) [2021-10-28 23:19:34,737 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:34,737 INFO L254 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] [2021-10-28 23:19:34,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:19:34,738 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1616909804, now seen corresponding path program 1 times [2021-10-28 23:19:34,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:34,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376086170] [2021-10-28 23:19:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:34,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:19:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:19:34,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:19:34,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376086170] [2021-10-28 23:19:34,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376086170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:19:34,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:19:34,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:19:34,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089578300] [2021-10-28 23:19:34,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:19:34,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:19:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:19:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:19:34,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2021-10-28 23:19:34,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 137 transitions, 637 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 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) [2021-10-28 23:19:34,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 23:19:34,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2021-10-28 23:19:34,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 23:19:35,701 INFO L129 PetriNetUnfolder]: 681/2354 cut-off events. [2021-10-28 23:19:35,701 INFO L130 PetriNetUnfolder]: For 4214/5768 co-relation queries the response was YES. [2021-10-28 23:19:35,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 2354 events. 681/2354 cut-off events. For 4214/5768 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 24757 event pairs, 8 based on Foata normal form. 513/2689 useless extension candidates. Maximal degree in co-relation 6818. Up to 392 conditions per place. [2021-10-28 23:19:35,811 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 10 selfloop transitions, 36 changer transitions 22/156 dead transitions. [2021-10-28 23:19:35,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 156 transitions, 859 flow [2021-10-28 23:19:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 23:19:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 23:19:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1476 transitions. [2021-10-28 23:19:35,817 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9027522935779817 [2021-10-28 23:19:35,817 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1476 transitions. [2021-10-28 23:19:35,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1476 transitions. [2021-10-28 23:19:35,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:19:35,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1476 transitions. [2021-10-28 23:19:35,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 98.4) internal successors, (1476), 15 states have internal predecessors, (1476), 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) [2021-10-28 23:19:35,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 109.0) internal successors, (1744), 16 states have internal predecessors, (1744), 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) [2021-10-28 23:19:35,830 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 109.0) internal successors, (1744), 16 states have internal predecessors, (1744), 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) [2021-10-28 23:19:35,831 INFO L186 Difference]: Start difference. First operand has 166 places, 137 transitions, 637 flow. Second operand 15 states and 1476 transitions. [2021-10-28 23:19:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 156 transitions, 859 flow [2021-10-28 23:19:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 156 transitions, 776 flow, removed 30 selfloop flow, removed 18 redundant places. [2021-10-28 23:19:35,874 INFO L242 Difference]: Finished difference. Result has 162 places, 131 transitions, 627 flow [2021-10-28 23:19:35,875 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=627, PETRI_PLACES=162, PETRI_TRANSITIONS=131} [2021-10-28 23:19:35,876 INFO L334 CegarLoopForPetriNet]: 114 programPoint places, 48 predicate places. [2021-10-28 23:19:35,876 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 131 transitions, 627 flow [2021-10-28 23:19:35,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 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) [2021-10-28 23:19:35,877 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 23:19:35,877 INFO L254 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] [2021-10-28 23:19:35,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:19:35,878 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 23:19:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:19:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 227083513, now seen corresponding path program 1 times [2021-10-28 23:19:35,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:19:35,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991432171] [2021-10-28 23:19:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:19:35,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:19:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:19:35,953 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:19:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:19:36,123 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:19:36,123 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:19:36,125 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:19:36,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:19:36,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 23:19:36,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 23:19:36,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 23:19:36,128 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:19:36,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:19:36,133 INFO L731 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:19:36,140 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 23:19:36,140 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:19:36,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:19:36 BasicIcfg [2021-10-28 23:19:36,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:19:36,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:19:36,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:19:36,393 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:19:36,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:19:25" (3/4) ... [2021-10-28 23:19:36,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 23:19:36,604 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:19:36,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:19:36,606 INFO L168 Benchmark]: Toolchain (without parser) took 14860.16 ms. Allocated memory was 102.8 MB in the beginning and 264.2 MB in the end (delta: 161.5 MB). Free memory was 69.9 MB in the beginning and 105.1 MB in the end (delta: -35.3 MB). Peak memory consumption was 125.7 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,607 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 102.8 MB. Free memory is still 57.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:19:36,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.83 ms. Allocated memory is still 102.8 MB. Free memory was 69.9 MB in the beginning and 63.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.50 ms. Allocated memory is still 102.8 MB. Free memory was 63.4 MB in the beginning and 60.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,610 INFO L168 Benchmark]: Boogie Preprocessor took 43.12 ms. Allocated memory is still 102.8 MB. Free memory was 60.5 MB in the beginning and 58.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,611 INFO L168 Benchmark]: RCFGBuilder took 2374.87 ms. Allocated memory was 102.8 MB in the beginning and 132.1 MB in the end (delta: 29.4 MB). Free memory was 58.3 MB in the beginning and 49.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,611 INFO L168 Benchmark]: TraceAbstraction took 11317.25 ms. Allocated memory was 132.1 MB in the beginning and 264.2 MB in the end (delta: 132.1 MB). Free memory was 49.1 MB in the beginning and 136.6 MB in the end (delta: -87.4 MB). Peak memory consumption was 44.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,612 INFO L168 Benchmark]: Witness Printer took 212.46 ms. Allocated memory is still 264.2 MB. Free memory was 136.6 MB in the beginning and 105.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:19:36,615 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.24 ms. Allocated memory is still 102.8 MB. Free memory is still 57.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 800.83 ms. Allocated memory is still 102.8 MB. Free memory was 69.9 MB in the beginning and 63.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.50 ms. Allocated memory is still 102.8 MB. Free memory was 63.4 MB in the beginning and 60.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.12 ms. Allocated memory is still 102.8 MB. Free memory was 60.5 MB in the beginning and 58.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2374.87 ms. Allocated memory was 102.8 MB in the beginning and 132.1 MB in the end (delta: 29.4 MB). Free memory was 58.3 MB in the beginning and 49.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11317.25 ms. Allocated memory was 132.1 MB in the beginning and 264.2 MB in the end (delta: 132.1 MB). Free memory was 49.1 MB in the beginning and 136.6 MB in the end (delta: -87.4 MB). Peak memory consumption was 44.6 MB. Max. memory is 16.1 GB. * Witness Printer took 212.46 ms. Allocated memory is still 264.2 MB. Free memory was 136.6 MB in the beginning and 105.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L726] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L727] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L728] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L729] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t515; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 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: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 102 SDtfs, 318 SDslu, 429 SDs, 0 SdLazy, 832 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=706occurred in iteration=8, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 800 ConstructedInterpolants, 0 QuantifiedInterpolants, 4433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2021-10-28 23:19:36,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b05af539-3d5a-4e9b-a47c-6f370f033243/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...