./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa --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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:30:08,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:30:08,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:30:08,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:30:08,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:30:08,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:30:08,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:30:08,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:30:08,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:30:08,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:30:08,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:30:08,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:30:08,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:30:08,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:30:08,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:30:08,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:30:08,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:30:08,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:30:08,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:30:08,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:30:08,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:30:08,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:30:08,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:30:08,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:30:08,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:30:08,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:30:08,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:30:08,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:30:08,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:30:08,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:30:08,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:30:08,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:30:08,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:30:08,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:30:08,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:30:08,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:30:08,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:30:08,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:30:08,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:30:08,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:30:08,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:30:08,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:30:08,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:30:08,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:30:08,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:30:08,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:30:08,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:30:08,512 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:30:08,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:30:08,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:30:08,513 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:30:08,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:30:08,513 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:30:08,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:30:08,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:30:08,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:30:08,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:30:08,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:30:08,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:30:08,515 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:30:08,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:30:08,515 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:30:08,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:30:08,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:30:08,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:30:08,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:30:08,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:30:08,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:30:08,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:30:08,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:30:08,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:30:08,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:30:08,517 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:30:08,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:30:08,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:30:08,518 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:30:08,518 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_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/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_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2021-12-06 18:30:08,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:30:08,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:30:08,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:30:08,726 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:30:08,726 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:30:08,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i [2021-12-06 18:30:08,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/data/08916283d/b33457f053db4992a38effac19d2d841/FLAG2b19267cd [2021-12-06 18:30:09,224 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:30:09,224 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2021-12-06 18:30:09,237 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/data/08916283d/b33457f053db4992a38effac19d2d841/FLAG2b19267cd [2021-12-06 18:30:09,752 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/data/08916283d/b33457f053db4992a38effac19d2d841 [2021-12-06 18:30:09,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:30:09,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:30:09,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:30:09,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:30:09,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:30:09,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:09" (1/1) ... [2021-12-06 18:30:09,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656b6b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:09, skipping insertion in model container [2021-12-06 18:30:09,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:09" (1/1) ... [2021-12-06 18:30:09,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:30:09,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:30:09,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/sv-benchmarks/c/pthread-wmm/mix027_tso.i[944,957] [2021-12-06 18:30:10,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:30:10,051 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:30:10,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/sv-benchmarks/c/pthread-wmm/mix027_tso.i[944,957] [2021-12-06 18:30:10,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:30:10,129 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:30:10,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10 WrapperNode [2021-12-06 18:30:10,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:30:10,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:30:10,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:30:10,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:30:10,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,174 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2021-12-06 18:30:10,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:30:10,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:30:10,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:30:10,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:30:10,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:30:10,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:30:10,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:30:10,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:30:10,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (1/1) ... [2021-12-06 18:30:10,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:30:10,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:30:10,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:30:10,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 18:30:10,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 18:30:10,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 18:30:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 18:30:10,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 18:30:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-06 18:30:10,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-06 18:30:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:30:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 18:30:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:30:10,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:30:10,262 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 18:30:10,364 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:30:10,365 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:30:10,727 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:30:10,947 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:30:10,947 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 18:30:10,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:10 BoogieIcfgContainer [2021-12-06 18:30:10,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:30:10,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:30:10,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:30:10,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:30:10,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:09" (1/3) ... [2021-12-06 18:30:10,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd217b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:10, skipping insertion in model container [2021-12-06 18:30:10,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:10" (2/3) ... [2021-12-06 18:30:10,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd217b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:10, skipping insertion in model container [2021-12-06 18:30:10,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:10" (3/3) ... [2021-12-06 18:30:10,955 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2021-12-06 18:30:10,958 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 18:30:10,958 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:30:10,959 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 18:30:10,959 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 18:30:10,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,990 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,990 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,990 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,991 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,991 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,991 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,992 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,992 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,992 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,992 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,992 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,993 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,993 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,993 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,993 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,993 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,994 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,994 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,994 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,994 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,998 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,998 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,998 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,998 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,998 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:10,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,004 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,004 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,004 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,004 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,005 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,005 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,005 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,005 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,005 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,006 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,007 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,007 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,007 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,007 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,007 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,007 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,008 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,009 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,009 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,009 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,009 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,012 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,013 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,013 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,013 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,013 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,013 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,014 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,014 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,017 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,017 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,018 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,018 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,018 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,018 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,018 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,018 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,019 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,019 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,021 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,022 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,022 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,022 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,022 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,022 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,022 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,023 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,023 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,023 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:11,023 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 18:30:11,071 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:30:11,078 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-12-06 18:30:11,079 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-06 18:30:11,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2021-12-06 18:30:11,144 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2021-12-06 18:30:11,145 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 18:30:11,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2021-12-06 18:30:11,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2021-12-06 18:30:11,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2021-12-06 18:30:11,169 INFO L129 PetriNetUnfolder]: 0/64 cut-off events. [2021-12-06 18:30:11,169 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 18:30:11,169 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:11,170 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] [2021-12-06 18:30:11,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1421907133, now seen corresponding path program 1 times [2021-12-06 18:30:11,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:11,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649098151] [2021-12-06 18:30:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:11,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:11,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:11,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649098151] [2021-12-06 18:30:11,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649098151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:11,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:11,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:30:11,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839447313] [2021-12-06 18:30:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:11,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:30:11,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:30:11,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:30:11,459 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2021-12-06 18:30:11,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-12-06 18:30:11,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:11,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2021-12-06 18:30:11,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:11,695 INFO L129 PetriNetUnfolder]: 161/1031 cut-off events. [2021-12-06 18:30:11,695 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-12-06 18:30:11,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 1031 events. 161/1031 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6982 event pairs, 103 based on Foata normal form. 34/1000 useless extension candidates. Maximal degree in co-relation 1276. Up to 187 conditions per place. [2021-12-06 18:30:11,708 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 17 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2021-12-06 18:30:11,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 328 flow [2021-12-06 18:30:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:30:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 18:30:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2021-12-06 18:30:11,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2021-12-06 18:30:11,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2021-12-06 18:30:11,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2021-12-06 18:30:11,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:11,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2021-12-06 18:30:11,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-12-06 18:30:11,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-12-06 18:30:11,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-12-06 18:30:11,734 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2021-12-06 18:30:11,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 328 flow [2021-12-06 18:30:11,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 136 transitions, 322 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 18:30:11,741 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2021-12-06 18:30:11,743 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2021-12-06 18:30:11,746 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2021-12-06 18:30:11,746 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2021-12-06 18:30:11,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-12-06 18:30:11,746 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:11,746 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-12-06 18:30:11,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:30:11,747 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2065629017, now seen corresponding path program 1 times [2021-12-06 18:30:11,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:11,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553586336] [2021-12-06 18:30:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:11,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:11,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553586336] [2021-12-06 18:30:11,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553586336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:11,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:11,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:11,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746271386] [2021-12-06 18:30:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:11,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:11,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:11,987 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 18:30:11,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-12-06 18:30:11,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:11,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 18:30:11,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:12,862 INFO L129 PetriNetUnfolder]: 2208/5490 cut-off events. [2021-12-06 18:30:12,863 INFO L130 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2021-12-06 18:30:12,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8992 conditions, 5490 events. 2208/5490 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 49010 event pairs, 516 based on Foata normal form. 0/5371 useless extension candidates. Maximal degree in co-relation 8936. Up to 1862 conditions per place. [2021-12-06 18:30:12,892 INFO L132 encePairwiseOnDemand]: 130/137 looper letters, 24 selfloop transitions, 3 changer transitions 62/184 dead transitions. [2021-12-06 18:30:12,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 184 transitions, 548 flow [2021-12-06 18:30:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 18:30:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 18:30:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2021-12-06 18:30:12,898 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2021-12-06 18:30:12,898 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2021-12-06 18:30:12,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2021-12-06 18:30:12,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:12,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2021-12-06 18:30:12,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 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-12-06 18:30:12,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-12-06 18:30:12,907 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-12-06 18:30:12,907 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1086 transitions. [2021-12-06 18:30:12,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 184 transitions, 548 flow [2021-12-06 18:30:12,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 184 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 18:30:12,911 INFO L242 Difference]: Finished difference. Result has 153 places, 117 transitions, 281 flow [2021-12-06 18:30:12,911 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=153, PETRI_TRANSITIONS=117} [2021-12-06 18:30:12,912 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2021-12-06 18:30:12,912 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 117 transitions, 281 flow [2021-12-06 18:30:12,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-12-06 18:30:12,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:12,913 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, 1, 1] [2021-12-06 18:30:12,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:30:12,913 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash 954989320, now seen corresponding path program 1 times [2021-12-06 18:30:12,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:12,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548449745] [2021-12-06 18:30:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:12,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:13,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:13,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548449745] [2021-12-06 18:30:13,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548449745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:13,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:13,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 18:30:13,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764727516] [2021-12-06 18:30:13,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:13,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:30:13,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:13,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:30:13,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:30:13,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 18:30:13,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 117 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 113.75) internal successors, (910), 8 states have internal predecessors, (910), 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-12-06 18:30:13,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:13,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 18:30:13,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:13,779 INFO L129 PetriNetUnfolder]: 1463/2946 cut-off events. [2021-12-06 18:30:13,779 INFO L130 PetriNetUnfolder]: For 2180/2215 co-relation queries the response was YES. [2021-12-06 18:30:13,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 2946 events. 1463/2946 cut-off events. For 2180/2215 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21420 event pairs, 370 based on Foata normal form. 79/2864 useless extension candidates. Maximal degree in co-relation 6548. Up to 1170 conditions per place. [2021-12-06 18:30:13,801 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 25 selfloop transitions, 11 changer transitions 52/185 dead transitions. [2021-12-06 18:30:13,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 185 transitions, 631 flow [2021-12-06 18:30:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 18:30:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 18:30:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1659 transitions. [2021-12-06 18:30:13,806 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.864963503649635 [2021-12-06 18:30:13,806 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1659 transitions. [2021-12-06 18:30:13,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1659 transitions. [2021-12-06 18:30:13,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:13,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1659 transitions. [2021-12-06 18:30:13,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 118.5) internal successors, (1659), 14 states have internal predecessors, (1659), 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-12-06 18:30:13,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-12-06 18:30:13,816 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-12-06 18:30:13,816 INFO L186 Difference]: Start difference. First operand has 153 places, 117 transitions, 281 flow. Second operand 14 states and 1659 transitions. [2021-12-06 18:30:13,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 185 transitions, 631 flow [2021-12-06 18:30:13,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 185 transitions, 610 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-06 18:30:13,835 INFO L242 Difference]: Finished difference. Result has 153 places, 125 transitions, 382 flow [2021-12-06 18:30:13,835 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=382, PETRI_PLACES=153, PETRI_TRANSITIONS=125} [2021-12-06 18:30:13,836 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2021-12-06 18:30:13,836 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 125 transitions, 382 flow [2021-12-06 18:30:13,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.75) internal successors, (910), 8 states have internal predecessors, (910), 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-12-06 18:30:13,836 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:13,836 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, 1, 1, 1, 1] [2021-12-06 18:30:13,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:30:13,837 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1062928618, now seen corresponding path program 1 times [2021-12-06 18:30:13,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:13,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514221148] [2021-12-06 18:30:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:13,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:13,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:13,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514221148] [2021-12-06 18:30:13,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514221148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:13,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:13,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:13,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025876857] [2021-12-06 18:30:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:13,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:13,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:13,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:13,966 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-12-06 18:30:13,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 125 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-12-06 18:30:13,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:13,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-12-06 18:30:13,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:14,692 INFO L129 PetriNetUnfolder]: 1454/2812 cut-off events. [2021-12-06 18:30:14,692 INFO L130 PetriNetUnfolder]: For 10759/11321 co-relation queries the response was YES. [2021-12-06 18:30:14,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11019 conditions, 2812 events. 1454/2812 cut-off events. For 10759/11321 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18880 event pairs, 259 based on Foata normal form. 88/2795 useless extension candidates. Maximal degree in co-relation 10944. Up to 996 conditions per place. [2021-12-06 18:30:14,739 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 48 selfloop transitions, 11 changer transitions 12/172 dead transitions. [2021-12-06 18:30:14,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 172 transitions, 868 flow [2021-12-06 18:30:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 18:30:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 18:30:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1088 transitions. [2021-12-06 18:30:14,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8824006488240065 [2021-12-06 18:30:14,743 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1088 transitions. [2021-12-06 18:30:14,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1088 transitions. [2021-12-06 18:30:14,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:14,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1088 transitions. [2021-12-06 18:30:14,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 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-12-06 18:30:14,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-12-06 18:30:14,749 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-12-06 18:30:14,749 INFO L186 Difference]: Start difference. First operand has 153 places, 125 transitions, 382 flow. Second operand 9 states and 1088 transitions. [2021-12-06 18:30:14,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 172 transitions, 868 flow [2021-12-06 18:30:14,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 172 transitions, 850 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-12-06 18:30:14,761 INFO L242 Difference]: Finished difference. Result has 151 places, 134 transitions, 467 flow [2021-12-06 18:30:14,761 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=151, PETRI_TRANSITIONS=134} [2021-12-06 18:30:14,762 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 7 predicate places. [2021-12-06 18:30:14,762 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 134 transitions, 467 flow [2021-12-06 18:30:14,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-12-06 18:30:14,762 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:14,762 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, 1, 1, 1, 1, 1] [2021-12-06 18:30:14,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 18:30:14,763 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1814499207, now seen corresponding path program 1 times [2021-12-06 18:30:14,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:14,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484454288] [2021-12-06 18:30:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:14,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:14,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:14,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484454288] [2021-12-06 18:30:14,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484454288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:14,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:14,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:30:14,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526428297] [2021-12-06 18:30:14,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:14,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:30:14,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:14,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:30:14,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:30:14,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 18:30:14,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 134 transitions, 467 flow. Second operand has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 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-12-06 18:30:14,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:14,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 18:30:14,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:15,843 INFO L129 PetriNetUnfolder]: 2126/4071 cut-off events. [2021-12-06 18:30:15,843 INFO L130 PetriNetUnfolder]: For 15940/16750 co-relation queries the response was YES. [2021-12-06 18:30:15,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 4071 events. 2126/4071 cut-off events. For 15940/16750 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29704 event pairs, 1027 based on Foata normal form. 46/3981 useless extension candidates. Maximal degree in co-relation 16107. Up to 1746 conditions per place. [2021-12-06 18:30:15,899 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 27 selfloop transitions, 14 changer transitions 53/189 dead transitions. [2021-12-06 18:30:15,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 189 transitions, 1086 flow [2021-12-06 18:30:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 18:30:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 18:30:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1503 transitions. [2021-12-06 18:30:15,904 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8439079169006176 [2021-12-06 18:30:15,904 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1503 transitions. [2021-12-06 18:30:15,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1503 transitions. [2021-12-06 18:30:15,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:15,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1503 transitions. [2021-12-06 18:30:15,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.61538461538461) internal successors, (1503), 13 states have internal predecessors, (1503), 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-12-06 18:30:15,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-12-06 18:30:15,911 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-12-06 18:30:15,911 INFO L186 Difference]: Start difference. First operand has 151 places, 134 transitions, 467 flow. Second operand 13 states and 1503 transitions. [2021-12-06 18:30:15,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 189 transitions, 1086 flow [2021-12-06 18:30:15,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 189 transitions, 1086 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 18:30:15,926 INFO L242 Difference]: Finished difference. Result has 170 places, 128 transitions, 498 flow [2021-12-06 18:30:15,926 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=498, PETRI_PLACES=170, PETRI_TRANSITIONS=128} [2021-12-06 18:30:15,927 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 26 predicate places. [2021-12-06 18:30:15,927 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 128 transitions, 498 flow [2021-12-06 18:30:15,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 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-12-06 18:30:15,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:15,928 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, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:15,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:30:15,928 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 332488827, now seen corresponding path program 1 times [2021-12-06 18:30:15,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:15,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215902345] [2021-12-06 18:30:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:15,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:16,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:16,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215902345] [2021-12-06 18:30:16,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215902345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:16,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:16,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:30:16,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305282294] [2021-12-06 18:30:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:16,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:30:16,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:30:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:30:16,067 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 18:30:16,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 128 transitions, 498 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 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-12-06 18:30:16,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:16,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 18:30:16,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:16,612 INFO L129 PetriNetUnfolder]: 934/1981 cut-off events. [2021-12-06 18:30:16,612 INFO L130 PetriNetUnfolder]: For 18529/19250 co-relation queries the response was YES. [2021-12-06 18:30:16,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10280 conditions, 1981 events. 934/1981 cut-off events. For 18529/19250 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12454 event pairs, 260 based on Foata normal form. 43/1942 useless extension candidates. Maximal degree in co-relation 10190. Up to 794 conditions per place. [2021-12-06 18:30:16,632 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 41 selfloop transitions, 10 changer transitions 32/180 dead transitions. [2021-12-06 18:30:16,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 1226 flow [2021-12-06 18:30:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 18:30:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 18:30:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1420 transitions. [2021-12-06 18:30:16,636 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8637469586374696 [2021-12-06 18:30:16,636 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1420 transitions. [2021-12-06 18:30:16,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1420 transitions. [2021-12-06 18:30:16,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:16,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1420 transitions. [2021-12-06 18:30:16,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.33333333333333) internal successors, (1420), 12 states have internal predecessors, (1420), 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-12-06 18:30:16,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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-12-06 18:30:16,643 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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-12-06 18:30:16,643 INFO L186 Difference]: Start difference. First operand has 170 places, 128 transitions, 498 flow. Second operand 12 states and 1420 transitions. [2021-12-06 18:30:16,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 1226 flow [2021-12-06 18:30:16,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 180 transitions, 1141 flow, removed 31 selfloop flow, removed 12 redundant places. [2021-12-06 18:30:16,653 INFO L242 Difference]: Finished difference. Result has 165 places, 133 transitions, 542 flow [2021-12-06 18:30:16,653 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=542, PETRI_PLACES=165, PETRI_TRANSITIONS=133} [2021-12-06 18:30:16,654 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 21 predicate places. [2021-12-06 18:30:16,654 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 133 transitions, 542 flow [2021-12-06 18:30:16,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 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-12-06 18:30:16,654 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:16,655 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:16,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 18:30:16,655 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash 99824650, now seen corresponding path program 1 times [2021-12-06 18:30:16,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:16,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197697306] [2021-12-06 18:30:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:16,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:16,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-12-06 18:30:16,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:16,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197697306] [2021-12-06 18:30:16,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197697306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:16,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:16,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:16,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900647486] [2021-12-06 18:30:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:16,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:16,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:16,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:16,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:16,742 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 18:30:16,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 133 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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-12-06 18:30:16,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:16,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 18:30:16,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:18,256 INFO L129 PetriNetUnfolder]: 5567/9758 cut-off events. [2021-12-06 18:30:18,256 INFO L130 PetriNetUnfolder]: For 90274/92152 co-relation queries the response was YES. [2021-12-06 18:30:18,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42989 conditions, 9758 events. 5567/9758 cut-off events. For 90274/92152 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 77053 event pairs, 171 based on Foata normal form. 96/9531 useless extension candidates. Maximal degree in co-relation 42902. Up to 3233 conditions per place. [2021-12-06 18:30:18,342 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 139 selfloop transitions, 20 changer transitions 8/264 dead transitions. [2021-12-06 18:30:18,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 264 transitions, 2117 flow [2021-12-06 18:30:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:30:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 18:30:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1200 transitions. [2021-12-06 18:30:18,345 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759124087591241 [2021-12-06 18:30:18,345 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1200 transitions. [2021-12-06 18:30:18,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1200 transitions. [2021-12-06 18:30:18,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:18,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1200 transitions. [2021-12-06 18:30:18,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 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-12-06 18:30:18,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-12-06 18:30:18,350 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-12-06 18:30:18,350 INFO L186 Difference]: Start difference. First operand has 165 places, 133 transitions, 542 flow. Second operand 10 states and 1200 transitions. [2021-12-06 18:30:18,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 264 transitions, 2117 flow [2021-12-06 18:30:18,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 264 transitions, 1558 flow, removed 261 selfloop flow, removed 15 redundant places. [2021-12-06 18:30:18,385 INFO L242 Difference]: Finished difference. Result has 159 places, 151 transitions, 588 flow [2021-12-06 18:30:18,386 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=588, PETRI_PLACES=159, PETRI_TRANSITIONS=151} [2021-12-06 18:30:18,386 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 15 predicate places. [2021-12-06 18:30:18,386 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 588 flow [2021-12-06 18:30:18,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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-12-06 18:30:18,387 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:18,387 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:18,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:30:18,387 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash 649875567, now seen corresponding path program 1 times [2021-12-06 18:30:18,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:18,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452506847] [2021-12-06 18:30:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:18,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:18,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:18,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452506847] [2021-12-06 18:30:18,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452506847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:18,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:18,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:30:18,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040365642] [2021-12-06 18:30:18,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:18,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:30:18,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:30:18,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:30:18,469 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 18:30:18,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 588 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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-12-06 18:30:18,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:18,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 18:30:18,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:20,029 INFO L129 PetriNetUnfolder]: 5049/9423 cut-off events. [2021-12-06 18:30:20,029 INFO L130 PetriNetUnfolder]: For 43827/45423 co-relation queries the response was YES. [2021-12-06 18:30:20,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38071 conditions, 9423 events. 5049/9423 cut-off events. For 43827/45423 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 78644 event pairs, 222 based on Foata normal form. 269/9494 useless extension candidates. Maximal degree in co-relation 37990. Up to 2048 conditions per place. [2021-12-06 18:30:20,128 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 159 selfloop transitions, 38 changer transitions 12/306 dead transitions. [2021-12-06 18:30:20,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 306 transitions, 2154 flow [2021-12-06 18:30:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 18:30:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 18:30:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1564 transitions. [2021-12-06 18:30:20,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8781583380123527 [2021-12-06 18:30:20,132 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1564 transitions. [2021-12-06 18:30:20,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1564 transitions. [2021-12-06 18:30:20,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:20,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1564 transitions. [2021-12-06 18:30:20,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.3076923076923) internal successors, (1564), 13 states have internal predecessors, (1564), 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-12-06 18:30:20,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-12-06 18:30:20,138 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-12-06 18:30:20,138 INFO L186 Difference]: Start difference. First operand has 159 places, 151 transitions, 588 flow. Second operand 13 states and 1564 transitions. [2021-12-06 18:30:20,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 306 transitions, 2154 flow [2021-12-06 18:30:20,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 306 transitions, 2152 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 18:30:20,182 INFO L242 Difference]: Finished difference. Result has 176 places, 169 transitions, 867 flow [2021-12-06 18:30:20,182 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=867, PETRI_PLACES=176, PETRI_TRANSITIONS=169} [2021-12-06 18:30:20,182 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 32 predicate places. [2021-12-06 18:30:20,182 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 867 flow [2021-12-06 18:30:20,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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-12-06 18:30:20,183 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:20,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:20,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:30:20,183 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 325149722, now seen corresponding path program 1 times [2021-12-06 18:30:20,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:20,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221651173] [2021-12-06 18:30:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:20,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:20,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221651173] [2021-12-06 18:30:20,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221651173] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:20,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:20,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 18:30:20,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796776751] [2021-12-06 18:30:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:20,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:30:20,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:20,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:30:20,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:30:20,282 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 18:30:20,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 867 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 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-12-06 18:30:20,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:20,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 18:30:20,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:21,784 INFO L129 PetriNetUnfolder]: 4740/9017 cut-off events. [2021-12-06 18:30:21,785 INFO L130 PetriNetUnfolder]: For 55144/56592 co-relation queries the response was YES. [2021-12-06 18:30:21,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41600 conditions, 9017 events. 4740/9017 cut-off events. For 55144/56592 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 76566 event pairs, 219 based on Foata normal form. 200/9022 useless extension candidates. Maximal degree in co-relation 41511. Up to 1873 conditions per place. [2021-12-06 18:30:21,855 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 145 selfloop transitions, 58 changer transitions 37/336 dead transitions. [2021-12-06 18:30:21,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 336 transitions, 2808 flow [2021-12-06 18:30:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 18:30:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 18:30:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1927 transitions. [2021-12-06 18:30:21,860 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8791058394160584 [2021-12-06 18:30:21,860 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1927 transitions. [2021-12-06 18:30:21,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1927 transitions. [2021-12-06 18:30:21,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:21,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1927 transitions. [2021-12-06 18:30:21,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.4375) internal successors, (1927), 16 states have internal predecessors, (1927), 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-12-06 18:30:21,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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-12-06 18:30:21,868 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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-12-06 18:30:21,868 INFO L186 Difference]: Start difference. First operand has 176 places, 169 transitions, 867 flow. Second operand 16 states and 1927 transitions. [2021-12-06 18:30:21,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 336 transitions, 2808 flow [2021-12-06 18:30:22,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 336 transitions, 2659 flow, removed 43 selfloop flow, removed 6 redundant places. [2021-12-06 18:30:22,197 INFO L242 Difference]: Finished difference. Result has 189 places, 191 transitions, 1198 flow [2021-12-06 18:30:22,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1198, PETRI_PLACES=189, PETRI_TRANSITIONS=191} [2021-12-06 18:30:22,198 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2021-12-06 18:30:22,198 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 191 transitions, 1198 flow [2021-12-06 18:30:22,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 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-12-06 18:30:22,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:22,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:22,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:30:22,198 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 793513959, now seen corresponding path program 1 times [2021-12-06 18:30:22,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:22,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845861166] [2021-12-06 18:30:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:22,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:22,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:22,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845861166] [2021-12-06 18:30:22,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845861166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:22,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:22,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 18:30:22,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130486982] [2021-12-06 18:30:22,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:22,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 18:30:22,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 18:30:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-06 18:30:22,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 137 [2021-12-06 18:30:22,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 191 transitions, 1198 flow. Second operand 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-12-06 18:30:22,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:22,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 137 [2021-12-06 18:30:22,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:23,619 INFO L129 PetriNetUnfolder]: 2129/7198 cut-off events. [2021-12-06 18:30:23,619 INFO L130 PetriNetUnfolder]: For 33128/35941 co-relation queries the response was YES. [2021-12-06 18:30:23,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26968 conditions, 7198 events. 2129/7198 cut-off events. For 33128/35941 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 86712 event pairs, 25 based on Foata normal form. 19/6747 useless extension candidates. Maximal degree in co-relation 26871. Up to 1431 conditions per place. [2021-12-06 18:30:23,709 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 72 selfloop transitions, 28 changer transitions 21/277 dead transitions. [2021-12-06 18:30:23,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 277 transitions, 2114 flow [2021-12-06 18:30:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 18:30:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 18:30:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1601 transitions. [2021-12-06 18:30:23,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8347236704900939 [2021-12-06 18:30:23,713 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1601 transitions. [2021-12-06 18:30:23,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1601 transitions. [2021-12-06 18:30:23,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:23,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1601 transitions. [2021-12-06 18:30:23,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.35714285714286) internal successors, (1601), 14 states have internal predecessors, (1601), 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-12-06 18:30:23,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-12-06 18:30:23,720 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-12-06 18:30:23,720 INFO L186 Difference]: Start difference. First operand has 189 places, 191 transitions, 1198 flow. Second operand 14 states and 1601 transitions. [2021-12-06 18:30:23,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 277 transitions, 2114 flow [2021-12-06 18:30:24,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 277 transitions, 1801 flow, removed 114 selfloop flow, removed 11 redundant places. [2021-12-06 18:30:24,458 INFO L242 Difference]: Finished difference. Result has 197 places, 210 transitions, 1105 flow [2021-12-06 18:30:24,458 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1105, PETRI_PLACES=197, PETRI_TRANSITIONS=210} [2021-12-06 18:30:24,458 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2021-12-06 18:30:24,459 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 210 transitions, 1105 flow [2021-12-06 18:30:24,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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-12-06 18:30:24,459 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:24,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:24,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:30:24,460 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 107505165, now seen corresponding path program 2 times [2021-12-06 18:30:24,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:24,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37092488] [2021-12-06 18:30:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:24,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:24,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:24,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37092488] [2021-12-06 18:30:24,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37092488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:24,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:24,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:30:24,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275294462] [2021-12-06 18:30:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:24,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:30:24,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:30:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:30:24,569 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2021-12-06 18:30:24,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 210 transitions, 1105 flow. Second operand has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 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-12-06 18:30:24,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:24,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2021-12-06 18:30:24,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:27,993 INFO L129 PetriNetUnfolder]: 12435/23186 cut-off events. [2021-12-06 18:30:27,993 INFO L130 PetriNetUnfolder]: For 154804/158137 co-relation queries the response was YES. [2021-12-06 18:30:28,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100979 conditions, 23186 events. 12435/23186 cut-off events. For 154804/158137 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 223045 event pairs, 385 based on Foata normal form. 495/23232 useless extension candidates. Maximal degree in co-relation 100940. Up to 4820 conditions per place. [2021-12-06 18:30:28,281 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 199 selfloop transitions, 63 changer transitions 92/456 dead transitions. [2021-12-06 18:30:28,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 456 transitions, 4147 flow [2021-12-06 18:30:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 18:30:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-06 18:30:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2244 transitions. [2021-12-06 18:30:28,284 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8620822128313484 [2021-12-06 18:30:28,284 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2244 transitions. [2021-12-06 18:30:28,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2244 transitions. [2021-12-06 18:30:28,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:28,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2244 transitions. [2021-12-06 18:30:28,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.10526315789474) internal successors, (2244), 19 states have internal predecessors, (2244), 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-12-06 18:30:28,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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-12-06 18:30:28,291 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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-12-06 18:30:28,291 INFO L186 Difference]: Start difference. First operand has 197 places, 210 transitions, 1105 flow. Second operand 19 states and 2244 transitions. [2021-12-06 18:30:28,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 456 transitions, 4147 flow [2021-12-06 18:30:29,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 456 transitions, 3657 flow, removed 202 selfloop flow, removed 10 redundant places. [2021-12-06 18:30:29,455 INFO L242 Difference]: Finished difference. Result has 209 places, 206 transitions, 1154 flow [2021-12-06 18:30:29,455 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1154, PETRI_PLACES=209, PETRI_TRANSITIONS=206} [2021-12-06 18:30:29,456 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 65 predicate places. [2021-12-06 18:30:29,456 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 206 transitions, 1154 flow [2021-12-06 18:30:29,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 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-12-06 18:30:29,457 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:29,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:29,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 18:30:29,457 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 541682017, now seen corresponding path program 1 times [2021-12-06 18:30:29,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088306883] [2021-12-06 18:30:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:29,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:29,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:29,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088306883] [2021-12-06 18:30:29,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088306883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:29,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:29,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:30:29,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210834093] [2021-12-06 18:30:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:29,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:30:29,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:30:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:30:29,554 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 18:30:29,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 206 transitions, 1154 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-12-06 18:30:29,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:29,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 18:30:29,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:31,076 INFO L129 PetriNetUnfolder]: 3484/11337 cut-off events. [2021-12-06 18:30:31,076 INFO L130 PetriNetUnfolder]: For 29649/31320 co-relation queries the response was YES. [2021-12-06 18:30:31,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37413 conditions, 11337 events. 3484/11337 cut-off events. For 29649/31320 co-relation queries the response was YES. Maximal size of possible extension queue 1368. Compared 148976 event pairs, 52 based on Foata normal form. 9/10724 useless extension candidates. Maximal degree in co-relation 37316. Up to 1119 conditions per place. [2021-12-06 18:30:31,208 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 58 selfloop transitions, 2 changer transitions 12/240 dead transitions. [2021-12-06 18:30:31,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 240 transitions, 1535 flow [2021-12-06 18:30:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:30:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 18:30:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2021-12-06 18:30:31,210 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8561001042752867 [2021-12-06 18:30:31,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2021-12-06 18:30:31,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2021-12-06 18:30:31,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:31,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2021-12-06 18:30:31,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 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-12-06 18:30:31,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-12-06 18:30:31,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-12-06 18:30:31,213 INFO L186 Difference]: Start difference. First operand has 209 places, 206 transitions, 1154 flow. Second operand 7 states and 821 transitions. [2021-12-06 18:30:31,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 240 transitions, 1535 flow [2021-12-06 18:30:32,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 240 transitions, 1377 flow, removed 31 selfloop flow, removed 17 redundant places. [2021-12-06 18:30:32,346 INFO L242 Difference]: Finished difference. Result has 200 places, 206 transitions, 1039 flow [2021-12-06 18:30:32,346 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=200, PETRI_TRANSITIONS=206} [2021-12-06 18:30:32,347 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 56 predicate places. [2021-12-06 18:30:32,347 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 206 transitions, 1039 flow [2021-12-06 18:30:32,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-12-06 18:30:32,347 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:32,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:32,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 18:30:32,347 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash -513608059, now seen corresponding path program 2 times [2021-12-06 18:30:32,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:32,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685768092] [2021-12-06 18:30:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:32,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:32,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:32,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685768092] [2021-12-06 18:30:32,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685768092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:32,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:32,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:32,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411555960] [2021-12-06 18:30:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:32,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:32,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:32,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:32,451 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2021-12-06 18:30:32,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 206 transitions, 1039 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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-12-06 18:30:32,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:32,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2021-12-06 18:30:32,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:34,810 INFO L129 PetriNetUnfolder]: 6597/21579 cut-off events. [2021-12-06 18:30:34,810 INFO L130 PetriNetUnfolder]: For 35414/36157 co-relation queries the response was YES. [2021-12-06 18:30:35,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62737 conditions, 21579 events. 6597/21579 cut-off events. For 35414/36157 co-relation queries the response was YES. Maximal size of possible extension queue 2829. Compared 314711 event pairs, 162 based on Foata normal form. 28/20300 useless extension candidates. Maximal degree in co-relation 62702. Up to 2420 conditions per place. [2021-12-06 18:30:35,039 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 27 selfloop transitions, 2 changer transitions 46/235 dead transitions. [2021-12-06 18:30:35,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 235 transitions, 1359 flow [2021-12-06 18:30:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 18:30:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 18:30:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2021-12-06 18:30:35,040 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077 [2021-12-06 18:30:35,040 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2021-12-06 18:30:35,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2021-12-06 18:30:35,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:35,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2021-12-06 18:30:35,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 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-12-06 18:30:35,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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-12-06 18:30:35,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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-12-06 18:30:35,043 INFO L186 Difference]: Start difference. First operand has 200 places, 206 transitions, 1039 flow. Second operand 6 states and 706 transitions. [2021-12-06 18:30:35,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 235 transitions, 1359 flow [2021-12-06 18:30:38,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 235 transitions, 1348 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-12-06 18:30:38,360 INFO L242 Difference]: Finished difference. Result has 202 places, 184 transitions, 901 flow [2021-12-06 18:30:38,360 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=901, PETRI_PLACES=202, PETRI_TRANSITIONS=184} [2021-12-06 18:30:38,361 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 58 predicate places. [2021-12-06 18:30:38,361 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 184 transitions, 901 flow [2021-12-06 18:30:38,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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-12-06 18:30:38,361 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:38,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:38,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 18:30:38,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1275934147, now seen corresponding path program 3 times [2021-12-06 18:30:38,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:38,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439725358] [2021-12-06 18:30:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:38,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:38,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439725358] [2021-12-06 18:30:38,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439725358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:38,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:38,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 18:30:38,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882933972] [2021-12-06 18:30:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:38,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 18:30:38,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 18:30:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-06 18:30:38,685 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2021-12-06 18:30:38,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 184 transitions, 901 flow. Second operand has 14 states, 14 states have (on average 107.85714285714286) internal successors, (1510), 14 states have internal predecessors, (1510), 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-12-06 18:30:38,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:38,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2021-12-06 18:30:38,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:39,862 INFO L129 PetriNetUnfolder]: 2523/8603 cut-off events. [2021-12-06 18:30:39,863 INFO L130 PetriNetUnfolder]: For 13785/14174 co-relation queries the response was YES. [2021-12-06 18:30:39,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24281 conditions, 8603 events. 2523/8603 cut-off events. For 13785/14174 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 107207 event pairs, 24 based on Foata normal form. 1/8156 useless extension candidates. Maximal degree in co-relation 24245. Up to 880 conditions per place. [2021-12-06 18:30:39,920 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 28 selfloop transitions, 9 changer transitions 7/198 dead transitions. [2021-12-06 18:30:39,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 198 transitions, 1071 flow [2021-12-06 18:30:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 18:30:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 18:30:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1207 transitions. [2021-12-06 18:30:39,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.80092899800929 [2021-12-06 18:30:39,921 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1207 transitions. [2021-12-06 18:30:39,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1207 transitions. [2021-12-06 18:30:39,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:39,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1207 transitions. [2021-12-06 18:30:39,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 109.72727272727273) internal successors, (1207), 11 states have internal predecessors, (1207), 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-12-06 18:30:39,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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-12-06 18:30:39,924 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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-12-06 18:30:39,924 INFO L186 Difference]: Start difference. First operand has 202 places, 184 transitions, 901 flow. Second operand 11 states and 1207 transitions. [2021-12-06 18:30:39,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 198 transitions, 1071 flow [2021-12-06 18:30:40,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 198 transitions, 1020 flow, removed 20 selfloop flow, removed 11 redundant places. [2021-12-06 18:30:40,405 INFO L242 Difference]: Finished difference. Result has 195 places, 186 transitions, 918 flow [2021-12-06 18:30:40,405 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=918, PETRI_PLACES=195, PETRI_TRANSITIONS=186} [2021-12-06 18:30:40,406 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 51 predicate places. [2021-12-06 18:30:40,406 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 186 transitions, 918 flow [2021-12-06 18:30:40,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 107.85714285714286) internal successors, (1510), 14 states have internal predecessors, (1510), 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-12-06 18:30:40,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:40,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:40,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 18:30:40,406 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1288582883, now seen corresponding path program 4 times [2021-12-06 18:30:40,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:40,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718152074] [2021-12-06 18:30:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:40,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:40,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:40,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718152074] [2021-12-06 18:30:40,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718152074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:40,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:40,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-06 18:30:40,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774321354] [2021-12-06 18:30:40,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:40,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:30:40,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:40,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:30:40,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-12-06 18:30:40,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 137 [2021-12-06 18:30:40,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 186 transitions, 918 flow. Second operand has 17 states, 17 states have (on average 106.58823529411765) internal successors, (1812), 17 states have internal predecessors, (1812), 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-12-06 18:30:40,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:40,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 137 [2021-12-06 18:30:40,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:42,329 INFO L129 PetriNetUnfolder]: 3868/12420 cut-off events. [2021-12-06 18:30:42,329 INFO L130 PetriNetUnfolder]: For 20644/21050 co-relation queries the response was YES. [2021-12-06 18:30:42,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35663 conditions, 12420 events. 3868/12420 cut-off events. For 20644/21050 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 163300 event pairs, 31 based on Foata normal form. 24/11768 useless extension candidates. Maximal degree in co-relation 35627. Up to 1340 conditions per place. [2021-12-06 18:30:42,402 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 40 selfloop transitions, 12 changer transitions 18/222 dead transitions. [2021-12-06 18:30:42,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 222 transitions, 1262 flow [2021-12-06 18:30:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 18:30:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 18:30:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1533 transitions. [2021-12-06 18:30:42,404 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7992700729927007 [2021-12-06 18:30:42,404 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1533 transitions. [2021-12-06 18:30:42,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1533 transitions. [2021-12-06 18:30:42,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:42,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1533 transitions. [2021-12-06 18:30:42,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 109.5) internal successors, (1533), 14 states have internal predecessors, (1533), 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-12-06 18:30:42,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-12-06 18:30:42,408 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-12-06 18:30:42,408 INFO L186 Difference]: Start difference. First operand has 195 places, 186 transitions, 918 flow. Second operand 14 states and 1533 transitions. [2021-12-06 18:30:42,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 222 transitions, 1262 flow [2021-12-06 18:30:43,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 222 transitions, 1228 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-12-06 18:30:43,374 INFO L242 Difference]: Finished difference. Result has 201 places, 188 transitions, 957 flow [2021-12-06 18:30:43,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=957, PETRI_PLACES=201, PETRI_TRANSITIONS=188} [2021-12-06 18:30:43,374 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 57 predicate places. [2021-12-06 18:30:43,374 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 188 transitions, 957 flow [2021-12-06 18:30:43,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 106.58823529411765) internal successors, (1812), 17 states have internal predecessors, (1812), 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-12-06 18:30:43,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:43,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:43,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 18:30:43,375 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 18:30:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1560066825, now seen corresponding path program 5 times [2021-12-06 18:30:43,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:43,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683229090] [2021-12-06 18:30:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:43,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:30:43,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 18:30:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:30:43,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 18:30:43,482 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 18:30:43,483 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-06 18:30:43,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-06 18:30:43,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-06 18:30:43,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-06 18:30:43,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-06 18:30:43,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-06 18:30:43,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-06 18:30:43,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 18:30:43,488 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:43,492 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 18:30:43,492 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 18:30:43,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:30:43 BasicIcfg [2021-12-06 18:30:43,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 18:30:43,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 18:30:43,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 18:30:43,606 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 18:30:43,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:10" (3/4) ... [2021-12-06 18:30:43,607 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 18:30:43,703 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 18:30:43,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 18:30:43,704 INFO L158 Benchmark]: Toolchain (without parser) took 33949.37ms. Allocated memory was 88.1MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 49.6MB in the beginning and 1.0GB in the end (delta: -969.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-06 18:30:43,704 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory was 67.7MB in the beginning and 67.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 18:30:43,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.95ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 49.4MB in the beginning and 67.2MB in the end (delta: -17.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-12-06 18:30:43,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.38ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 64.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 18:30:43,705 INFO L158 Benchmark]: Boogie Preprocessor took 30.18ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 61.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 18:30:43,706 INFO L158 Benchmark]: RCFGBuilder took 742.88ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 63.7MB in the end (delta: -2.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2021-12-06 18:30:43,706 INFO L158 Benchmark]: TraceAbstraction took 32655.54ms. Allocated memory was 107.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 63.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-06 18:30:43,706 INFO L158 Benchmark]: Witness Printer took 97.98ms. Allocated memory is still 2.5GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 49.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2021-12-06 18:30:43,708 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.12ms. Allocated memory is still 88.1MB. Free memory was 67.7MB in the beginning and 67.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.95ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 49.4MB in the beginning and 67.2MB in the end (delta: -17.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.38ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 64.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.18ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 61.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 742.88ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 63.7MB in the end (delta: -2.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32655.54ms. Allocated memory was 107.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 63.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 97.98ms. Allocated memory is still 2.5GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 49.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L851] 0 pthread_t t737; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L853] 0 pthread_t t738; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L855] 0 pthread_t t739; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L857] 0 pthread_t t740; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L786] 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) [L786] 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) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 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 [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 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 [L756] 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) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] 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) [L756] 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) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 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 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 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 [L806] 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) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] 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) [L806] 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) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 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 [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 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 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 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 [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 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 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 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) [L875] 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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] - 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: 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 9 procedures, 174 locations, 7 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: 32.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1070 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1070 mSDsluCounter, 717 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1538 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2583 IncrementalHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 134 mSDtfsCounter, 2583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1198occurred in iteration=9, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1511 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 7436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-12-06 18:30:43,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b820f58d-acf1-45b1-9a2b-031a4a316123/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE