./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg --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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:18:47,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:18:47,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:18:47,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:18:47,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:18:47,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:18:47,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:18:47,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:18:47,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:18:47,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:18:47,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:18:47,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:18:47,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:18:47,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:18:47,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:18:47,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:18:47,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:18:47,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:18:47,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:18:47,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:18:47,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:18:47,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:18:47,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:18:47,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:18:47,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:18:47,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:18:47,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:18:47,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:18:47,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:18:47,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:18:47,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:18:47,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:18:47,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:18:47,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:18:47,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:18:47,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:18:47,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:18:47,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:18:47,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:18:47,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:18:47,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:18:47,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:18:47,697 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:18:47,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:18:47,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:18:47,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:18:47,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:18:47,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:18:47,701 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:18:47,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:18:47,701 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:18:47,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:18:47,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:18:47,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:18:47,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:18:47,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:18:47,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:18:47,705 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:18:47,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:18:47,705 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:18:47,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:18:47,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:18:47,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:18:47,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:18:47,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:18:47,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:18:47,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:18:47,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:18:47,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:18:47,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:18:47,709 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:18:47,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:18:47,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:18:47,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:18:47,712 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_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/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_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2021-10-28 09:18:48,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:18:48,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:18:48,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:18:48,126 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:18:48,127 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:18:48,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2021-10-28 09:18:48,222 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/data/c8d4b1764/a561f61f916445daaff6f86ea32f8647/FLAG696228cd3 [2021-10-28 09:18:48,966 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:18:48,968 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2021-10-28 09:18:49,007 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/data/c8d4b1764/a561f61f916445daaff6f86ea32f8647/FLAG696228cd3 [2021-10-28 09:18:49,098 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/data/c8d4b1764/a561f61f916445daaff6f86ea32f8647 [2021-10-28 09:18:49,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:18:49,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:18:49,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:18:49,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:18:49,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:18:49,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:49,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aefc9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49, skipping insertion in model container [2021-10-28 09:18:49,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:49,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:18:49,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:18:49,426 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-10-28 09:18:49,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:18:49,749 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:18:49,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-10-28 09:18:49,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:18:49,963 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:18:49,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49 WrapperNode [2021-10-28 09:18:49,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:18:49,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:18:49,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:18:49,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:18:49,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:18:50,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:18:50,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:18:50,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:18:50,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:18:50,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:18:50,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:18:50,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:18:50,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (1/1) ... [2021-10-28 09:18:50,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:18:50,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:18:50,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:18:50,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:18:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:18:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 09:18:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:18:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:18:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 09:18:50,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 09:18:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 09:18:50,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 09:18:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 09:18:50,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 09:18:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:18:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 09:18:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:18:50,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:18:50,257 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 09:18:54,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:18:54,095 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 09:18:54,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:18:54 BoogieIcfgContainer [2021-10-28 09:18:54,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:18:54,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:18:54,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:18:54,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:18:54,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:18:49" (1/3) ... [2021-10-28 09:18:54,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1827b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:18:54, skipping insertion in model container [2021-10-28 09:18:54,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:49" (2/3) ... [2021-10-28 09:18:54,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1827b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:18:54, skipping insertion in model container [2021-10-28 09:18:54,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:18:54" (3/3) ... [2021-10-28 09:18:54,110 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2021-10-28 09:18:54,120 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 09:18:54,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:18:54,120 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:18:54,121 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 09:18:54,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,186 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,186 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,186 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,187 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,190 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,200 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,200 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,201 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,201 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,308 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,308 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,308 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:18:54,313 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 09:18:54,381 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:18:54,399 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:18:54,399 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-28 09:18:54,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-10-28 09:18:54,495 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-10-28 09:18:54,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:18:54,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-28 09:18:54,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-10-28 09:18:54,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-10-28 09:18:54,530 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-10-28 09:18:54,531 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:18:54,531 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:18:54,532 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] [2021-10-28 09:18:54,532 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:18:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1934636311, now seen corresponding path program 1 times [2021-10-28 09:18:54,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:54,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620754083] [2021-10-28 09:18:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:54,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:54,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:54,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620754083] [2021-10-28 09:18:54,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620754083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:54,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:54,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:18:54,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287875380] [2021-10-28 09:18:54,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:18:54,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:18:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:18:54,996 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 09:18:55,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:55,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:18:55,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 09:18:55,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:18:55,382 INFO L129 PetriNetUnfolder]: 115/685 cut-off events. [2021-10-28 09:18:55,382 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:18:55,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 685 events. 115/685 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4557 event pairs, 92 based on Foata normal form. 34/675 useless extension candidates. Maximal degree in co-relation 836. Up to 141 conditions per place. [2021-10-28 09:18:55,395 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 13 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2021-10-28 09:18:55,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 249 flow [2021-10-28 09:18:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:18:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 09:18:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2021-10-28 09:18:55,412 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2021-10-28 09:18:55,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2021-10-28 09:18:55,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2021-10-28 09:18:55,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:18:55,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2021-10-28 09:18:55,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:55,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:55,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:55,436 INFO L186 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 299 transitions. [2021-10-28 09:18:55,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 249 flow [2021-10-28 09:18:55,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 105 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-28 09:18:55,445 INFO L242 Difference]: Finished difference. Result has 108 places, 99 transitions, 208 flow [2021-10-28 09:18:55,448 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2021-10-28 09:18:55,449 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2021-10-28 09:18:55,449 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 208 flow [2021-10-28 09:18:55,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:55,450 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:18:55,450 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] [2021-10-28 09:18:55,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:18:55,451 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:18:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -902715647, now seen corresponding path program 1 times [2021-10-28 09:18:55,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:55,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156031220] [2021-10-28 09:18:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:55,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:55,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:55,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156031220] [2021-10-28 09:18:55,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156031220] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:55,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:55,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:55,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661302504] [2021-10-28 09:18:55,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:55,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:55,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 09:18:55,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:55,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:18:55,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 09:18:55,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:18:56,152 INFO L129 PetriNetUnfolder]: 30/242 cut-off events. [2021-10-28 09:18:56,152 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:18:56,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 242 events. 30/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 850 event pairs, 6 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 279. Up to 36 conditions per place. [2021-10-28 09:18:56,155 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 8 selfloop transitions, 3 changer transitions 31/122 dead transitions. [2021-10-28 09:18:56,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 122 transitions, 320 flow [2021-10-28 09:18:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:18:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:18:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2021-10-28 09:18:56,165 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9140461215932913 [2021-10-28 09:18:56,166 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2021-10-28 09:18:56,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2021-10-28 09:18:56,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:18:56,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2021-10-28 09:18:56,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,181 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,181 INFO L186 Difference]: Start difference. First operand has 108 places, 99 transitions, 208 flow. Second operand 9 states and 872 transitions. [2021-10-28 09:18:56,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 122 transitions, 320 flow [2021-10-28 09:18:56,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:18:56,188 INFO L242 Difference]: Finished difference. Result has 121 places, 91 transitions, 227 flow [2021-10-28 09:18:56,189 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=121, PETRI_TRANSITIONS=91} [2021-10-28 09:18:56,190 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2021-10-28 09:18:56,190 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 91 transitions, 227 flow [2021-10-28 09:18:56,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,191 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:18:56,191 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:56,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:18:56,192 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:18:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1606667456, now seen corresponding path program 1 times [2021-10-28 09:18:56,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307706337] [2021-10-28 09:18:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:56,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:56,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307706337] [2021-10-28 09:18:56,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307706337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:56,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:56,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:56,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874468813] [2021-10-28 09:18:56,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:56,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:56,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-10-28 09:18:56,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 91 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:18:56,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-10-28 09:18:56,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:18:56,664 INFO L129 PetriNetUnfolder]: 28/193 cut-off events. [2021-10-28 09:18:56,664 INFO L130 PetriNetUnfolder]: For 172/173 co-relation queries the response was YES. [2021-10-28 09:18:56,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 193 events. 28/193 cut-off events. For 172/173 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 553 event pairs, 9 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 359. Up to 31 conditions per place. [2021-10-28 09:18:56,667 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 10/101 dead transitions. [2021-10-28 09:18:56,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 101 transitions, 301 flow [2021-10-28 09:18:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:18:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:18:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 866 transitions. [2021-10-28 09:18:56,672 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9077568134171907 [2021-10-28 09:18:56,672 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 866 transitions. [2021-10-28 09:18:56,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 866 transitions. [2021-10-28 09:18:56,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:18:56,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 866 transitions. [2021-10-28 09:18:56,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,682 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,683 INFO L186 Difference]: Start difference. First operand has 121 places, 91 transitions, 227 flow. Second operand 9 states and 866 transitions. [2021-10-28 09:18:56,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 101 transitions, 301 flow [2021-10-28 09:18:56,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 101 transitions, 284 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-10-28 09:18:56,690 INFO L242 Difference]: Finished difference. Result has 116 places, 91 transitions, 238 flow [2021-10-28 09:18:56,691 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=116, PETRI_TRANSITIONS=91} [2021-10-28 09:18:56,691 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2021-10-28 09:18:56,691 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 91 transitions, 238 flow [2021-10-28 09:18:56,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:56,692 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:18:56,692 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] [2021-10-28 09:18:56,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:18:56,693 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:18:56,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash 564245475, now seen corresponding path program 1 times [2021-10-28 09:18:56,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:56,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864168069] [2021-10-28 09:18:56,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:56,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:57,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:57,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864168069] [2021-10-28 09:18:57,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864168069] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:57,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:57,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:18:57,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471731189] [2021-10-28 09:18:57,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:18:57,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:18:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:18:57,172 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 09:18:57,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 91 transitions, 238 flow. Second operand has 11 states, 11 states have (on average 83.18181818181819) internal successors, (915), 11 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:57,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:18:57,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 09:18:57,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:18:58,583 INFO L129 PetriNetUnfolder]: 1000/1849 cut-off events. [2021-10-28 09:18:58,583 INFO L130 PetriNetUnfolder]: For 1903/1903 co-relation queries the response was YES. [2021-10-28 09:18:58,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4698 conditions, 1849 events. 1000/1849 cut-off events. For 1903/1903 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10495 event pairs, 194 based on Foata normal form. 48/1827 useless extension candidates. Maximal degree in co-relation 4635. Up to 677 conditions per place. [2021-10-28 09:18:58,610 INFO L132 encePairwiseOnDemand]: 90/106 looper letters, 19 selfloop transitions, 12 changer transitions 61/164 dead transitions. [2021-10-28 09:18:58,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 164 transitions, 622 flow [2021-10-28 09:18:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:18:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:18:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1407 transitions. [2021-10-28 09:18:58,618 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8295990566037735 [2021-10-28 09:18:58,618 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1407 transitions. [2021-10-28 09:18:58,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1407 transitions. [2021-10-28 09:18:58,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:18:58,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1407 transitions. [2021-10-28 09:18:58,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.9375) internal successors, (1407), 16 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:58,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:58,633 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:58,633 INFO L186 Difference]: Start difference. First operand has 116 places, 91 transitions, 238 flow. Second operand 16 states and 1407 transitions. [2021-10-28 09:18:58,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 164 transitions, 622 flow [2021-10-28 09:18:58,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 164 transitions, 578 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-10-28 09:18:58,666 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 350 flow [2021-10-28 09:18:58,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=350, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2021-10-28 09:18:58,667 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2021-10-28 09:18:58,667 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 350 flow [2021-10-28 09:18:58,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.18181818181819) internal successors, (915), 11 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:58,670 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:18:58,671 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:58,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:18:58,672 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:18:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -713297082, now seen corresponding path program 1 times [2021-10-28 09:18:58,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:58,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620839092] [2021-10-28 09:18:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:58,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:58,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:58,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620839092] [2021-10-28 09:18:58,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620839092] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:58,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:58,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:58,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010254646] [2021-10-28 09:18:58,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:58,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:58,953 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 09:18:58,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:58,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:18:58,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 09:18:58,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:18:59,522 INFO L129 PetriNetUnfolder]: 424/1098 cut-off events. [2021-10-28 09:18:59,522 INFO L130 PetriNetUnfolder]: For 5674/5755 co-relation queries the response was YES. [2021-10-28 09:18:59,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4700 conditions, 1098 events. 424/1098 cut-off events. For 5674/5755 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6976 event pairs, 196 based on Foata normal form. 34/1093 useless extension candidates. Maximal degree in co-relation 4629. Up to 475 conditions per place. [2021-10-28 09:18:59,544 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 12 selfloop transitions, 3 changer transitions 10/111 dead transitions. [2021-10-28 09:18:59,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 518 flow [2021-10-28 09:18:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:18:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:18:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2021-10-28 09:18:59,549 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9046121593291404 [2021-10-28 09:18:59,550 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2021-10-28 09:18:59,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2021-10-28 09:18:59,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:18:59,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2021-10-28 09:18:59,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:59,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:59,559 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:59,560 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 350 flow. Second operand 9 states and 863 transitions. [2021-10-28 09:18:59,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 518 flow [2021-10-28 09:18:59,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 111 transitions, 472 flow, removed 16 selfloop flow, removed 7 redundant places. [2021-10-28 09:18:59,578 INFO L242 Difference]: Finished difference. Result has 128 places, 97 transitions, 349 flow [2021-10-28 09:18:59,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=128, PETRI_TRANSITIONS=97} [2021-10-28 09:18:59,579 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2021-10-28 09:18:59,579 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 97 transitions, 349 flow [2021-10-28 09:18:59,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:59,580 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:18:59,580 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:18:59,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:18:59,582 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:18:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:18:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash -913537880, now seen corresponding path program 1 times [2021-10-28 09:18:59,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:18:59,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430048006] [2021-10-28 09:18:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:18:59,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:18:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:18:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:18:59,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:18:59,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430048006] [2021-10-28 09:18:59,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430048006] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:18:59,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:18:59,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:18:59,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023328435] [2021-10-28 09:18:59,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:18:59,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:18:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:18:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:18:59,839 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-10-28 09:18:59,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 97 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:18:59,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:18:59,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-10-28 09:18:59,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:00,302 INFO L129 PetriNetUnfolder]: 351/909 cut-off events. [2021-10-28 09:19:00,302 INFO L130 PetriNetUnfolder]: For 5830/5870 co-relation queries the response was YES. [2021-10-28 09:19:00,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4101 conditions, 909 events. 351/909 cut-off events. For 5830/5870 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5373 event pairs, 160 based on Foata normal form. 35/901 useless extension candidates. Maximal degree in co-relation 4030. Up to 407 conditions per place. [2021-10-28 09:19:00,320 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 10/107 dead transitions. [2021-10-28 09:19:00,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 107 transitions, 479 flow [2021-10-28 09:19:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:19:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:19:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 866 transitions. [2021-10-28 09:19:00,325 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9077568134171907 [2021-10-28 09:19:00,325 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 866 transitions. [2021-10-28 09:19:00,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 866 transitions. [2021-10-28 09:19:00,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:00,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 866 transitions. [2021-10-28 09:19:00,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:00,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:00,336 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:00,336 INFO L186 Difference]: Start difference. First operand has 128 places, 97 transitions, 349 flow. Second operand 9 states and 866 transitions. [2021-10-28 09:19:00,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 107 transitions, 479 flow [2021-10-28 09:19:00,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 107 transitions, 442 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-10-28 09:19:00,350 INFO L242 Difference]: Finished difference. Result has 130 places, 97 transitions, 348 flow [2021-10-28 09:19:00,351 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=348, PETRI_PLACES=130, PETRI_TRANSITIONS=97} [2021-10-28 09:19:00,351 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 19 predicate places. [2021-10-28 09:19:00,351 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 97 transitions, 348 flow [2021-10-28 09:19:00,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:00,352 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:00,352 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] [2021-10-28 09:19:00,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:19:00,353 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 663069958, now seen corresponding path program 1 times [2021-10-28 09:19:00,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:00,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541853298] [2021-10-28 09:19:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:00,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:00,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:00,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541853298] [2021-10-28 09:19:00,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541853298] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:00,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:00,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:19:00,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836819129] [2021-10-28 09:19:00,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:19:00,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:19:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:19:00,766 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2021-10-28 09:19:00,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 97 transitions, 348 flow. Second operand has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:00,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:00,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2021-10-28 09:19:00,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:01,746 INFO L129 PetriNetUnfolder]: 549/1230 cut-off events. [2021-10-28 09:19:01,746 INFO L130 PetriNetUnfolder]: For 6290/6743 co-relation queries the response was YES. [2021-10-28 09:19:01,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5344 conditions, 1230 events. 549/1230 cut-off events. For 6290/6743 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7290 event pairs, 277 based on Foata normal form. 24/1201 useless extension candidates. Maximal degree in co-relation 5268. Up to 635 conditions per place. [2021-10-28 09:19:01,773 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 29 selfloop transitions, 9 changer transitions 37/148 dead transitions. [2021-10-28 09:19:01,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 148 transitions, 899 flow [2021-10-28 09:19:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:19:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:19:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1235 transitions. [2021-10-28 09:19:01,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8322102425876011 [2021-10-28 09:19:01,780 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1235 transitions. [2021-10-28 09:19:01,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1235 transitions. [2021-10-28 09:19:01,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:01,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1235 transitions. [2021-10-28 09:19:01,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.21428571428571) internal successors, (1235), 14 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:01,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:01,793 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:01,793 INFO L186 Difference]: Start difference. First operand has 130 places, 97 transitions, 348 flow. Second operand 14 states and 1235 transitions. [2021-10-28 09:19:01,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 148 transitions, 899 flow [2021-10-28 09:19:01,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 148 transitions, 845 flow, removed 24 selfloop flow, removed 8 redundant places. [2021-10-28 09:19:01,808 INFO L242 Difference]: Finished difference. Result has 140 places, 102 transitions, 439 flow [2021-10-28 09:19:01,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=439, PETRI_PLACES=140, PETRI_TRANSITIONS=102} [2021-10-28 09:19:01,809 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 29 predicate places. [2021-10-28 09:19:01,810 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 102 transitions, 439 flow [2021-10-28 09:19:01,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:01,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:01,811 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] [2021-10-28 09:19:01,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:19:01,811 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1213330694, now seen corresponding path program 2 times [2021-10-28 09:19:01,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:01,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001412216] [2021-10-28 09:19:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:01,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:02,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:02,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001412216] [2021-10-28 09:19:02,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001412216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:02,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:02,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:19:02,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509268001] [2021-10-28 09:19:02,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:19:02,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:19:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:19:02,217 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 09:19:02,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 102 transitions, 439 flow. Second operand has 12 states, 12 states have (on average 83.25) internal successors, (999), 12 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:02,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:02,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 09:19:02,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:03,816 INFO L129 PetriNetUnfolder]: 814/1701 cut-off events. [2021-10-28 09:19:03,817 INFO L130 PetriNetUnfolder]: For 14213/15666 co-relation queries the response was YES. [2021-10-28 09:19:03,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9672 conditions, 1701 events. 814/1701 cut-off events. For 14213/15666 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10624 event pairs, 144 based on Foata normal form. 51/1697 useless extension candidates. Maximal degree in co-relation 9589. Up to 705 conditions per place. [2021-10-28 09:19:03,856 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 37 selfloop transitions, 27 changer transitions 73/209 dead transitions. [2021-10-28 09:19:03,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 209 transitions, 2017 flow [2021-10-28 09:19:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-28 09:19:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-10-28 09:19:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2346 transitions. [2021-10-28 09:19:03,866 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8197064989517819 [2021-10-28 09:19:03,866 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2346 transitions. [2021-10-28 09:19:03,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2346 transitions. [2021-10-28 09:19:03,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:03,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2346 transitions. [2021-10-28 09:19:03,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 86.88888888888889) internal successors, (2346), 27 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:03,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 106.0) internal successors, (2968), 28 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:03,889 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 106.0) internal successors, (2968), 28 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:03,889 INFO L186 Difference]: Start difference. First operand has 140 places, 102 transitions, 439 flow. Second operand 27 states and 2346 transitions. [2021-10-28 09:19:03,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 209 transitions, 2017 flow [2021-10-28 09:19:03,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 209 transitions, 1879 flow, removed 60 selfloop flow, removed 8 redundant places. [2021-10-28 09:19:03,920 INFO L242 Difference]: Finished difference. Result has 172 places, 120 transitions, 771 flow [2021-10-28 09:19:03,921 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=771, PETRI_PLACES=172, PETRI_TRANSITIONS=120} [2021-10-28 09:19:03,921 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 61 predicate places. [2021-10-28 09:19:03,921 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 120 transitions, 771 flow [2021-10-28 09:19:03,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.25) internal successors, (999), 12 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:03,922 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:03,922 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] [2021-10-28 09:19:03,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:19:03,923 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:03,924 INFO L85 PathProgramCache]: Analyzing trace with hash -476911985, now seen corresponding path program 1 times [2021-10-28 09:19:03,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:03,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033527090] [2021-10-28 09:19:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:03,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:04,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:04,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033527090] [2021-10-28 09:19:04,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033527090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:04,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:04,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:19:04,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777879556] [2021-10-28 09:19:04,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:19:04,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:19:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:19:04,237 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2021-10-28 09:19:04,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 120 transitions, 771 flow. Second operand has 12 states, 12 states have (on average 82.33333333333333) internal successors, (988), 12 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:04,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:04,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2021-10-28 09:19:04,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:05,437 INFO L129 PetriNetUnfolder]: 935/1972 cut-off events. [2021-10-28 09:19:05,437 INFO L130 PetriNetUnfolder]: For 29730/31099 co-relation queries the response was YES. [2021-10-28 09:19:05,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13641 conditions, 1972 events. 935/1972 cut-off events. For 29730/31099 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12895 event pairs, 215 based on Foata normal form. 55/1952 useless extension candidates. Maximal degree in co-relation 13538. Up to 841 conditions per place. [2021-10-28 09:19:05,497 INFO L132 encePairwiseOnDemand]: 91/106 looper letters, 45 selfloop transitions, 13 changer transitions 39/168 dead transitions. [2021-10-28 09:19:05,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 168 transitions, 1717 flow [2021-10-28 09:19:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:19:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 09:19:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 945 transitions. [2021-10-28 09:19:05,509 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8104631217838765 [2021-10-28 09:19:05,509 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 945 transitions. [2021-10-28 09:19:05,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 945 transitions. [2021-10-28 09:19:05,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:05,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 945 transitions. [2021-10-28 09:19:05,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:05,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:05,529 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:05,529 INFO L186 Difference]: Start difference. First operand has 172 places, 120 transitions, 771 flow. Second operand 11 states and 945 transitions. [2021-10-28 09:19:05,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 168 transitions, 1717 flow [2021-10-28 09:19:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 168 transitions, 1546 flow, removed 84 selfloop flow, removed 20 redundant places. [2021-10-28 09:19:05,626 INFO L242 Difference]: Finished difference. Result has 149 places, 119 transitions, 715 flow [2021-10-28 09:19:05,627 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=715, PETRI_PLACES=149, PETRI_TRANSITIONS=119} [2021-10-28 09:19:05,627 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 38 predicate places. [2021-10-28 09:19:05,628 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 119 transitions, 715 flow [2021-10-28 09:19:05,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.33333333333333) internal successors, (988), 12 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:05,629 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:05,629 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] [2021-10-28 09:19:05,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:19:05,629 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1902776911, now seen corresponding path program 2 times [2021-10-28 09:19:05,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:05,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844992406] [2021-10-28 09:19:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:05,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:05,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:05,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844992406] [2021-10-28 09:19:05,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844992406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:05,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:05,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:19:05,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262728949] [2021-10-28 09:19:05,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:19:06,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:06,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:19:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:19:06,003 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-10-28 09:19:06,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 119 transitions, 715 flow. Second operand has 12 states, 12 states have (on average 81.41666666666667) internal successors, (977), 12 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:06,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:06,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-10-28 09:19:06,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:07,090 INFO L129 PetriNetUnfolder]: 655/1472 cut-off events. [2021-10-28 09:19:07,090 INFO L130 PetriNetUnfolder]: For 16746/17884 co-relation queries the response was YES. [2021-10-28 09:19:07,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9417 conditions, 1472 events. 655/1472 cut-off events. For 16746/17884 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9336 event pairs, 110 based on Foata normal form. 58/1484 useless extension candidates. Maximal degree in co-relation 9319. Up to 579 conditions per place. [2021-10-28 09:19:07,131 INFO L132 encePairwiseOnDemand]: 91/106 looper letters, 44 selfloop transitions, 15 changer transitions 50/179 dead transitions. [2021-10-28 09:19:07,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 179 transitions, 1857 flow [2021-10-28 09:19:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:19:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:19:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1348 transitions. [2021-10-28 09:19:07,136 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7948113207547169 [2021-10-28 09:19:07,136 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1348 transitions. [2021-10-28 09:19:07,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1348 transitions. [2021-10-28 09:19:07,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:07,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1348 transitions. [2021-10-28 09:19:07,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 84.25) internal successors, (1348), 16 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:07,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:07,149 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:07,150 INFO L186 Difference]: Start difference. First operand has 149 places, 119 transitions, 715 flow. Second operand 16 states and 1348 transitions. [2021-10-28 09:19:07,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 179 transitions, 1857 flow [2021-10-28 09:19:07,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 179 transitions, 1806 flow, removed 10 selfloop flow, removed 10 redundant places. [2021-10-28 09:19:07,198 INFO L242 Difference]: Finished difference. Result has 159 places, 120 transitions, 785 flow [2021-10-28 09:19:07,199 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=785, PETRI_PLACES=159, PETRI_TRANSITIONS=120} [2021-10-28 09:19:07,199 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 48 predicate places. [2021-10-28 09:19:07,200 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 120 transitions, 785 flow [2021-10-28 09:19:07,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.41666666666667) internal successors, (977), 12 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:07,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:07,201 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] [2021-10-28 09:19:07,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:19:07,201 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash 92118192, now seen corresponding path program 1 times [2021-10-28 09:19:07,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:07,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678941168] [2021-10-28 09:19:07,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:07,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:07,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:07,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678941168] [2021-10-28 09:19:07,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678941168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:07,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:07,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:19:07,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795980564] [2021-10-28 09:19:07,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:19:07,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:19:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:19:07,794 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-10-28 09:19:07,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 120 transitions, 785 flow. Second operand has 15 states, 15 states have (on average 81.2) internal successors, (1218), 15 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:07,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:07,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-10-28 09:19:07,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:09,081 INFO L129 PetriNetUnfolder]: 445/1146 cut-off events. [2021-10-28 09:19:09,082 INFO L130 PetriNetUnfolder]: For 15507/16818 co-relation queries the response was YES. [2021-10-28 09:19:09,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 1146 events. 445/1146 cut-off events. For 15507/16818 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7351 event pairs, 108 based on Foata normal form. 31/1138 useless extension candidates. Maximal degree in co-relation 7226. Up to 477 conditions per place. [2021-10-28 09:19:09,122 INFO L132 encePairwiseOnDemand]: 91/106 looper letters, 39 selfloop transitions, 32 changer transitions 46/187 dead transitions. [2021-10-28 09:19:09,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 187 transitions, 2078 flow [2021-10-28 09:19:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-28 09:19:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-28 09:19:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2099 transitions. [2021-10-28 09:19:09,129 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7920754716981132 [2021-10-28 09:19:09,129 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2099 transitions. [2021-10-28 09:19:09,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2099 transitions. [2021-10-28 09:19:09,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:09,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2099 transitions. [2021-10-28 09:19:09,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 83.96) internal successors, (2099), 25 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:09,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 106.0) internal successors, (2756), 26 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:09,152 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 106.0) internal successors, (2756), 26 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:09,152 INFO L186 Difference]: Start difference. First operand has 159 places, 120 transitions, 785 flow. Second operand 25 states and 2099 transitions. [2021-10-28 09:19:09,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 187 transitions, 2078 flow [2021-10-28 09:19:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 187 transitions, 1853 flow, removed 93 selfloop flow, removed 15 redundant places. [2021-10-28 09:19:09,210 INFO L242 Difference]: Finished difference. Result has 180 places, 127 transitions, 959 flow [2021-10-28 09:19:09,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=959, PETRI_PLACES=180, PETRI_TRANSITIONS=127} [2021-10-28 09:19:09,211 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 69 predicate places. [2021-10-28 09:19:09,211 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 127 transitions, 959 flow [2021-10-28 09:19:09,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.2) internal successors, (1218), 15 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:09,212 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:09,212 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] [2021-10-28 09:19:09,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:19:09,213 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash -968794513, now seen corresponding path program 1 times [2021-10-28 09:19:09,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:09,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333764008] [2021-10-28 09:19:09,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:09,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:10,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:10,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333764008] [2021-10-28 09:19:10,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333764008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:10,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:10,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-28 09:19:10,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038497257] [2021-10-28 09:19:10,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-28 09:19:10,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-28 09:19:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-10-28 09:19:10,105 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2021-10-28 09:19:10,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 127 transitions, 959 flow. Second operand has 17 states, 17 states have (on average 79.17647058823529) internal successors, (1346), 17 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:10,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:10,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2021-10-28 09:19:10,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:10,967 INFO L129 PetriNetUnfolder]: 407/1047 cut-off events. [2021-10-28 09:19:10,967 INFO L130 PetriNetUnfolder]: For 19598/20974 co-relation queries the response was YES. [2021-10-28 09:19:10,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 1047 events. 407/1047 cut-off events. For 19598/20974 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6621 event pairs, 107 based on Foata normal form. 25/1034 useless extension candidates. Maximal degree in co-relation 7315. Up to 612 conditions per place. [2021-10-28 09:19:10,996 INFO L132 encePairwiseOnDemand]: 93/106 looper letters, 47 selfloop transitions, 15 changer transitions 19/149 dead transitions. [2021-10-28 09:19:10,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 149 transitions, 1482 flow [2021-10-28 09:19:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:19:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:19:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1300 transitions. [2021-10-28 09:19:11,003 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7665094339622641 [2021-10-28 09:19:11,003 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1300 transitions. [2021-10-28 09:19:11,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1300 transitions. [2021-10-28 09:19:11,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:11,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1300 transitions. [2021-10-28 09:19:11,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 81.25) internal successors, (1300), 16 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:11,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:11,036 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:11,036 INFO L186 Difference]: Start difference. First operand has 180 places, 127 transitions, 959 flow. Second operand 16 states and 1300 transitions. [2021-10-28 09:19:11,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 149 transitions, 1482 flow [2021-10-28 09:19:11,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 149 transitions, 1277 flow, removed 93 selfloop flow, removed 21 redundant places. [2021-10-28 09:19:11,103 INFO L242 Difference]: Finished difference. Result has 166 places, 127 transitions, 901 flow [2021-10-28 09:19:11,103 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=901, PETRI_PLACES=166, PETRI_TRANSITIONS=127} [2021-10-28 09:19:11,104 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 55 predicate places. [2021-10-28 09:19:11,104 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 127 transitions, 901 flow [2021-10-28 09:19:11,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 79.17647058823529) internal successors, (1346), 17 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:11,105 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:11,105 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:11,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:19:11,105 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash 645575612, now seen corresponding path program 1 times [2021-10-28 09:19:11,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:11,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998089214] [2021-10-28 09:19:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:11,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:11,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:11,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998089214] [2021-10-28 09:19:11,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998089214] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:11,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:11,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:19:11,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353283170] [2021-10-28 09:19:11,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:19:11,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:19:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:19:11,503 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 09:19:11,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 127 transitions, 901 flow. Second operand has 11 states, 11 states have (on average 83.54545454545455) internal successors, (919), 11 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:11,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:11,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 09:19:11,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:12,664 INFO L129 PetriNetUnfolder]: 557/1551 cut-off events. [2021-10-28 09:19:12,664 INFO L130 PetriNetUnfolder]: For 19150/20627 co-relation queries the response was YES. [2021-10-28 09:19:12,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9209 conditions, 1551 events. 557/1551 cut-off events. For 19150/20627 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11673 event pairs, 61 based on Foata normal form. 59/1569 useless extension candidates. Maximal degree in co-relation 9104. Up to 530 conditions per place. [2021-10-28 09:19:12,696 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 49 selfloop transitions, 23 changer transitions 54/197 dead transitions. [2021-10-28 09:19:12,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 197 transitions, 2346 flow [2021-10-28 09:19:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:19:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:19:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1393 transitions. [2021-10-28 09:19:12,701 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8213443396226415 [2021-10-28 09:19:12,702 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1393 transitions. [2021-10-28 09:19:12,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1393 transitions. [2021-10-28 09:19:12,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:12,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1393 transitions. [2021-10-28 09:19:12,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.0625) internal successors, (1393), 16 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:12,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:12,713 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:12,713 INFO L186 Difference]: Start difference. First operand has 166 places, 127 transitions, 901 flow. Second operand 16 states and 1393 transitions. [2021-10-28 09:19:12,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 197 transitions, 2346 flow [2021-10-28 09:19:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2190 flow, removed 61 selfloop flow, removed 16 redundant places. [2021-10-28 09:19:12,767 INFO L242 Difference]: Finished difference. Result has 171 places, 134 transitions, 1044 flow [2021-10-28 09:19:12,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1044, PETRI_PLACES=171, PETRI_TRANSITIONS=134} [2021-10-28 09:19:12,768 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 60 predicate places. [2021-10-28 09:19:12,769 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 134 transitions, 1044 flow [2021-10-28 09:19:12,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.54545454545455) internal successors, (919), 11 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:12,769 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:12,769 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:12,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:19:12,770 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -333716780, now seen corresponding path program 1 times [2021-10-28 09:19:12,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:12,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105963820] [2021-10-28 09:19:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:12,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:13,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:13,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105963820] [2021-10-28 09:19:13,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105963820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:13,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:13,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:19:13,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400950208] [2021-10-28 09:19:13,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:19:13,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:19:13,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:19:13,425 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-10-28 09:19:13,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 134 transitions, 1044 flow. Second operand has 14 states, 14 states have (on average 81.42857142857143) internal successors, (1140), 14 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:13,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:13,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-10-28 09:19:13,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:14,699 INFO L129 PetriNetUnfolder]: 354/1247 cut-off events. [2021-10-28 09:19:14,699 INFO L130 PetriNetUnfolder]: For 13583/15171 co-relation queries the response was YES. [2021-10-28 09:19:14,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 1247 events. 354/1247 cut-off events. For 13583/15171 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10332 event pairs, 76 based on Foata normal form. 30/1237 useless extension candidates. Maximal degree in co-relation 6848. Up to 416 conditions per place. [2021-10-28 09:19:14,721 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 49 selfloop transitions, 18 changer transitions 33/169 dead transitions. [2021-10-28 09:19:14,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 169 transitions, 1824 flow [2021-10-28 09:19:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:19:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-28 09:19:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1422 transitions. [2021-10-28 09:19:14,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7891231964483907 [2021-10-28 09:19:14,727 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1422 transitions. [2021-10-28 09:19:14,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1422 transitions. [2021-10-28 09:19:14,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:14,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1422 transitions. [2021-10-28 09:19:14,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 83.6470588235294) internal successors, (1422), 17 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:14,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:14,737 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:14,737 INFO L186 Difference]: Start difference. First operand has 171 places, 134 transitions, 1044 flow. Second operand 17 states and 1422 transitions. [2021-10-28 09:19:14,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 169 transitions, 1824 flow [2021-10-28 09:19:14,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 169 transitions, 1663 flow, removed 75 selfloop flow, removed 14 redundant places. [2021-10-28 09:19:14,777 INFO L242 Difference]: Finished difference. Result has 175 places, 130 transitions, 969 flow [2021-10-28 09:19:14,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=969, PETRI_PLACES=175, PETRI_TRANSITIONS=130} [2021-10-28 09:19:14,778 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 64 predicate places. [2021-10-28 09:19:14,778 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 130 transitions, 969 flow [2021-10-28 09:19:14,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.42857142857143) internal successors, (1140), 14 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:14,779 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:14,779 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:14,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:19:14,780 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash 626354197, now seen corresponding path program 1 times [2021-10-28 09:19:14,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:14,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779343498] [2021-10-28 09:19:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:14,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:15,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:15,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779343498] [2021-10-28 09:19:15,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779343498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:15,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:15,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:19:15,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984311951] [2021-10-28 09:19:15,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:19:15,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:19:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:19:15,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 106 [2021-10-28 09:19:15,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 130 transitions, 969 flow. Second operand has 13 states, 13 states have (on average 80.53846153846153) internal successors, (1047), 13 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:15,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:15,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 106 [2021-10-28 09:19:15,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:16,253 INFO L129 PetriNetUnfolder]: 264/901 cut-off events. [2021-10-28 09:19:16,253 INFO L130 PetriNetUnfolder]: For 10898/11727 co-relation queries the response was YES. [2021-10-28 09:19:16,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 901 events. 264/901 cut-off events. For 10898/11727 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6419 event pairs, 111 based on Foata normal form. 21/894 useless extension candidates. Maximal degree in co-relation 4968. Up to 395 conditions per place. [2021-10-28 09:19:16,269 INFO L132 encePairwiseOnDemand]: 93/106 looper letters, 44 selfloop transitions, 20 changer transitions 24/157 dead transitions. [2021-10-28 09:19:16,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 157 transitions, 1603 flow [2021-10-28 09:19:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:19:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:19:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1163 transitions. [2021-10-28 09:19:16,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836927223719676 [2021-10-28 09:19:16,274 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1163 transitions. [2021-10-28 09:19:16,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1163 transitions. [2021-10-28 09:19:16,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:16,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1163 transitions. [2021-10-28 09:19:16,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 83.07142857142857) internal successors, (1163), 14 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:16,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:16,285 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:16,285 INFO L186 Difference]: Start difference. First operand has 175 places, 130 transitions, 969 flow. Second operand 14 states and 1163 transitions. [2021-10-28 09:19:16,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 157 transitions, 1603 flow [2021-10-28 09:19:16,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 157 transitions, 1462 flow, removed 55 selfloop flow, removed 15 redundant places. [2021-10-28 09:19:16,330 INFO L242 Difference]: Finished difference. Result has 172 places, 130 transitions, 981 flow [2021-10-28 09:19:16,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=981, PETRI_PLACES=172, PETRI_TRANSITIONS=130} [2021-10-28 09:19:16,331 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 61 predicate places. [2021-10-28 09:19:16,331 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 130 transitions, 981 flow [2021-10-28 09:19:16,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 80.53846153846153) internal successors, (1047), 13 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:16,332 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:16,332 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:16,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:19:16,333 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1358960632, now seen corresponding path program 2 times [2021-10-28 09:19:16,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:16,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175061273] [2021-10-28 09:19:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:16,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:16,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-10-28 09:19:16,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:16,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175061273] [2021-10-28 09:19:16,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175061273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:16,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:16,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:19:16,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672464354] [2021-10-28 09:19:16,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:19:16,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:19:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:19:16,792 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2021-10-28 09:19:16,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 130 transitions, 981 flow. Second operand has 13 states, 13 states have (on average 79.61538461538461) internal successors, (1035), 13 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:16,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:16,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2021-10-28 09:19:16,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:17,493 INFO L129 PetriNetUnfolder]: 263/880 cut-off events. [2021-10-28 09:19:17,494 INFO L130 PetriNetUnfolder]: For 11743/12574 co-relation queries the response was YES. [2021-10-28 09:19:17,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5236 conditions, 880 events. 263/880 cut-off events. For 11743/12574 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6176 event pairs, 95 based on Foata normal form. 28/884 useless extension candidates. Maximal degree in co-relation 5129. Up to 385 conditions per place. [2021-10-28 09:19:17,512 INFO L132 encePairwiseOnDemand]: 91/106 looper letters, 62 selfloop transitions, 25 changer transitions 22/177 dead transitions. [2021-10-28 09:19:17,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 177 transitions, 1995 flow [2021-10-28 09:19:17,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:19:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:19:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1239 transitions. [2021-10-28 09:19:17,516 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.779245283018868 [2021-10-28 09:19:17,517 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1239 transitions. [2021-10-28 09:19:17,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1239 transitions. [2021-10-28 09:19:17,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:17,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1239 transitions. [2021-10-28 09:19:17,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 82.6) internal successors, (1239), 15 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:17,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:17,526 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:17,526 INFO L186 Difference]: Start difference. First operand has 172 places, 130 transitions, 981 flow. Second operand 15 states and 1239 transitions. [2021-10-28 09:19:17,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 177 transitions, 1995 flow [2021-10-28 09:19:17,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 177 transitions, 1924 flow, removed 25 selfloop flow, removed 8 redundant places. [2021-10-28 09:19:17,570 INFO L242 Difference]: Finished difference. Result has 182 places, 145 transitions, 1254 flow [2021-10-28 09:19:17,571 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1254, PETRI_PLACES=182, PETRI_TRANSITIONS=145} [2021-10-28 09:19:17,571 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 71 predicate places. [2021-10-28 09:19:17,571 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 145 transitions, 1254 flow [2021-10-28 09:19:17,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 79.61538461538461) internal successors, (1035), 13 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:17,572 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:17,572 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:17,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:19:17,573 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 83520849, now seen corresponding path program 2 times [2021-10-28 09:19:17,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:17,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108220801] [2021-10-28 09:19:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:17,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:18,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:18,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108220801] [2021-10-28 09:19:18,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108220801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:18,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:18,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:19:18,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782172444] [2021-10-28 09:19:18,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:19:18,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:19:18,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:19:18,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-10-28 09:19:18,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 145 transitions, 1254 flow. Second operand has 14 states, 14 states have (on average 81.35714285714286) internal successors, (1139), 14 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:18,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:18,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-10-28 09:19:18,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:18,806 INFO L129 PetriNetUnfolder]: 243/858 cut-off events. [2021-10-28 09:19:18,806 INFO L130 PetriNetUnfolder]: For 15985/17437 co-relation queries the response was YES. [2021-10-28 09:19:18,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5550 conditions, 858 events. 243/858 cut-off events. For 15985/17437 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6078 event pairs, 97 based on Foata normal form. 35/868 useless extension candidates. Maximal degree in co-relation 5439. Up to 369 conditions per place. [2021-10-28 09:19:18,822 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 54 selfloop transitions, 19 changer transitions 30/173 dead transitions. [2021-10-28 09:19:18,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 173 transitions, 2078 flow [2021-10-28 09:19:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:19:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:19:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1257 transitions. [2021-10-28 09:19:18,827 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7905660377358491 [2021-10-28 09:19:18,827 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1257 transitions. [2021-10-28 09:19:18,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1257 transitions. [2021-10-28 09:19:18,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:18,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1257 transitions. [2021-10-28 09:19:18,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 83.8) internal successors, (1257), 15 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:18,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:18,835 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:18,836 INFO L186 Difference]: Start difference. First operand has 182 places, 145 transitions, 1254 flow. Second operand 15 states and 1257 transitions. [2021-10-28 09:19:18,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 173 transitions, 2078 flow [2021-10-28 09:19:18,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 173 transitions, 1961 flow, removed 50 selfloop flow, removed 9 redundant places. [2021-10-28 09:19:18,906 INFO L242 Difference]: Finished difference. Result has 188 places, 139 transitions, 1223 flow [2021-10-28 09:19:18,906 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1223, PETRI_PLACES=188, PETRI_TRANSITIONS=139} [2021-10-28 09:19:18,907 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 77 predicate places. [2021-10-28 09:19:18,907 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 139 transitions, 1223 flow [2021-10-28 09:19:18,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.35714285714286) internal successors, (1139), 14 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:18,908 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:18,908 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:18,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:19:18,908 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 503334410, now seen corresponding path program 3 times [2021-10-28 09:19:18,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:18,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517213632] [2021-10-28 09:19:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:18,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:19,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:19,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517213632] [2021-10-28 09:19:19,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517213632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:19,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:19,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:19:19,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570613957] [2021-10-28 09:19:19,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:19:19,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:19:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:19:19,414 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2021-10-28 09:19:19,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 139 transitions, 1223 flow. Second operand has 15 states, 15 states have (on average 79.4) internal successors, (1191), 15 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:19,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:19,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2021-10-28 09:19:19,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:20,150 INFO L129 PetriNetUnfolder]: 194/728 cut-off events. [2021-10-28 09:19:20,150 INFO L130 PetriNetUnfolder]: For 11145/11937 co-relation queries the response was YES. [2021-10-28 09:19:20,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4404 conditions, 728 events. 194/728 cut-off events. For 11145/11937 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5104 event pairs, 39 based on Foata normal form. 48/758 useless extension candidates. Maximal degree in co-relation 4288. Up to 238 conditions per place. [2021-10-28 09:19:20,161 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 28 selfloop transitions, 11 changer transitions 62/167 dead transitions. [2021-10-28 09:19:20,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 167 transitions, 1969 flow [2021-10-28 09:19:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:19:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:19:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1229 transitions. [2021-10-28 09:19:20,166 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7729559748427673 [2021-10-28 09:19:20,166 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1229 transitions. [2021-10-28 09:19:20,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1229 transitions. [2021-10-28 09:19:20,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:20,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1229 transitions. [2021-10-28 09:19:20,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 81.93333333333334) internal successors, (1229), 15 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,175 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,175 INFO L186 Difference]: Start difference. First operand has 188 places, 139 transitions, 1223 flow. Second operand 15 states and 1229 transitions. [2021-10-28 09:19:20,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 167 transitions, 1969 flow [2021-10-28 09:19:20,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 167 transitions, 1815 flow, removed 41 selfloop flow, removed 16 redundant places. [2021-10-28 09:19:20,235 INFO L242 Difference]: Finished difference. Result has 187 places, 104 transitions, 671 flow [2021-10-28 09:19:20,236 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=671, PETRI_PLACES=187, PETRI_TRANSITIONS=104} [2021-10-28 09:19:20,236 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 76 predicate places. [2021-10-28 09:19:20,236 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 104 transitions, 671 flow [2021-10-28 09:19:20,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 79.4) internal successors, (1191), 15 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,237 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:20,237 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:20,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:19:20,238 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1909083229, now seen corresponding path program 1 times [2021-10-28 09:19:20,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:20,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665392780] [2021-10-28 09:19:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:20,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:20,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:20,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665392780] [2021-10-28 09:19:20,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665392780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:20,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:20,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:19:20,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446280273] [2021-10-28 09:19:20,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:19:20,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:20,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:19:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:19:20,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:19:20,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 104 transitions, 671 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:20,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:19:20,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:20,778 INFO L129 PetriNetUnfolder]: 455/1186 cut-off events. [2021-10-28 09:19:20,778 INFO L130 PetriNetUnfolder]: For 5369/5419 co-relation queries the response was YES. [2021-10-28 09:19:20,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 1186 events. 455/1186 cut-off events. For 5369/5419 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 8912 event pairs, 88 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 3568. Up to 291 conditions per place. [2021-10-28 09:19:20,801 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 24 selfloop transitions, 17 changer transitions 0/128 dead transitions. [2021-10-28 09:19:20,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 128 transitions, 723 flow [2021-10-28 09:19:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:19:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 09:19:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-10-28 09:19:20,804 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9084905660377358 [2021-10-28 09:19:20,805 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-10-28 09:19:20,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-10-28 09:19:20,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:20,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-10-28 09:19:20,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,812 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,812 INFO L186 Difference]: Start difference. First operand has 187 places, 104 transitions, 671 flow. Second operand 10 states and 963 transitions. [2021-10-28 09:19:20,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 128 transitions, 723 flow [2021-10-28 09:19:20,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 583 flow, removed 34 selfloop flow, removed 44 redundant places. [2021-10-28 09:19:20,838 INFO L242 Difference]: Finished difference. Result has 137 places, 113 transitions, 561 flow [2021-10-28 09:19:20,838 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=561, PETRI_PLACES=137, PETRI_TRANSITIONS=113} [2021-10-28 09:19:20,840 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 26 predicate places. [2021-10-28 09:19:20,840 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 113 transitions, 561 flow [2021-10-28 09:19:20,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:20,840 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:20,841 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] [2021-10-28 09:19:20,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:19:20,841 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1316570239, now seen corresponding path program 1 times [2021-10-28 09:19:20,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:20,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607187622] [2021-10-28 09:19:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:20,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:21,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:21,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607187622] [2021-10-28 09:19:21,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607187622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:21,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:21,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:19:21,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264468080] [2021-10-28 09:19:21,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:19:21,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:19:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:19:21,029 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:19:21,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 113 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:21,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:21,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:19:21,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:21,412 INFO L129 PetriNetUnfolder]: 391/1144 cut-off events. [2021-10-28 09:19:21,412 INFO L130 PetriNetUnfolder]: For 3084/3729 co-relation queries the response was YES. [2021-10-28 09:19:21,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 1144 events. 391/1144 cut-off events. For 3084/3729 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9178 event pairs, 11 based on Foata normal form. 163/1230 useless extension candidates. Maximal degree in co-relation 3984. Up to 388 conditions per place. [2021-10-28 09:19:21,429 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 20 selfloop transitions, 32 changer transitions 9/148 dead transitions. [2021-10-28 09:19:21,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 148 transitions, 907 flow [2021-10-28 09:19:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:19:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 09:19:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2021-10-28 09:19:21,435 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909288824383164 [2021-10-28 09:19:21,436 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2021-10-28 09:19:21,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2021-10-28 09:19:21,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:21,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2021-10-28 09:19:21,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:21,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:21,448 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:21,448 INFO L186 Difference]: Start difference. First operand has 137 places, 113 transitions, 561 flow. Second operand 13 states and 1253 transitions. [2021-10-28 09:19:21,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 148 transitions, 907 flow [2021-10-28 09:19:21,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 148 transitions, 896 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-10-28 09:19:21,462 INFO L242 Difference]: Finished difference. Result has 151 places, 133 transitions, 793 flow [2021-10-28 09:19:21,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=793, PETRI_PLACES=151, PETRI_TRANSITIONS=133} [2021-10-28 09:19:21,463 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 40 predicate places. [2021-10-28 09:19:21,463 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 133 transitions, 793 flow [2021-10-28 09:19:21,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:21,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:21,464 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:21,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:19:21,464 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:21,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1637944684, now seen corresponding path program 1 times [2021-10-28 09:19:21,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:21,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703798471] [2021-10-28 09:19:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:21,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:21,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:21,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703798471] [2021-10-28 09:19:21,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703798471] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:21,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:21,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:19:21,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420032776] [2021-10-28 09:19:21,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:19:21,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:21,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:19:21,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:19:21,694 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:19:21,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 133 transitions, 793 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:21,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:19:21,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:19:21,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:19:22,132 INFO L129 PetriNetUnfolder]: 311/1035 cut-off events. [2021-10-28 09:19:22,133 INFO L130 PetriNetUnfolder]: For 3933/4614 co-relation queries the response was YES. [2021-10-28 09:19:22,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 1035 events. 311/1035 cut-off events. For 3933/4614 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 8800 event pairs, 3 based on Foata normal form. 157/1118 useless extension candidates. Maximal degree in co-relation 4081. Up to 315 conditions per place. [2021-10-28 09:19:22,149 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 16 selfloop transitions, 36 changer transitions 20/159 dead transitions. [2021-10-28 09:19:22,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 159 transitions, 1111 flow [2021-10-28 09:19:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:19:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:19:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1528 transitions. [2021-10-28 09:19:22,153 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2021-10-28 09:19:22,154 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1528 transitions. [2021-10-28 09:19:22,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1528 transitions. [2021-10-28 09:19:22,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:19:22,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1528 transitions. [2021-10-28 09:19:22,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.5) internal successors, (1528), 16 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:22,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:22,162 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:22,162 INFO L186 Difference]: Start difference. First operand has 151 places, 133 transitions, 793 flow. Second operand 16 states and 1528 transitions. [2021-10-28 09:19:22,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 159 transitions, 1111 flow [2021-10-28 09:19:22,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 159 transitions, 913 flow, removed 78 selfloop flow, removed 10 redundant places. [2021-10-28 09:19:22,201 INFO L242 Difference]: Finished difference. Result has 163 places, 133 transitions, 745 flow [2021-10-28 09:19:22,201 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=745, PETRI_PLACES=163, PETRI_TRANSITIONS=133} [2021-10-28 09:19:22,201 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 52 predicate places. [2021-10-28 09:19:22,202 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 133 transitions, 745 flow [2021-10-28 09:19:22,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:22,202 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:19:22,203 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] [2021-10-28 09:19:22,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 09:19:22,203 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:19:22,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -563585601, now seen corresponding path program 1 times [2021-10-28 09:19:22,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:22,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787164] [2021-10-28 09:19:22,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:22,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:19:22,330 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:19:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:19:22,521 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:19:22,522 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:19:22,523 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:19:22,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:19:22,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 09:19:22,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 09:19:22,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 09:19:22,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:19:22,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 09:19:22,530 INFO L731 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:22,537 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 09:19:22,537 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:19:22,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:19:22 BasicIcfg [2021-10-28 09:19:22,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:19:22,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:19:22,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:19:22,751 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:19:22,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:18:54" (3/4) ... [2021-10-28 09:19:22,755 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:19:22,986 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:19:22,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:19:22,988 INFO L168 Benchmark]: Toolchain (without parser) took 33883.88 ms. Allocated memory was 100.7 MB in the beginning and 559.9 MB in the end (delta: 459.3 MB). Free memory was 57.8 MB in the beginning and 246.6 MB in the end (delta: -188.8 MB). Peak memory consumption was 269.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,989 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 100.7 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:19:22,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.46 ms. Allocated memory is still 100.7 MB. Free memory was 57.6 MB in the beginning and 58.6 MB in the end (delta: -974.9 kB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.40 ms. Allocated memory is still 100.7 MB. Free memory was 58.6 MB in the beginning and 55.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,990 INFO L168 Benchmark]: Boogie Preprocessor took 77.95 ms. Allocated memory is still 100.7 MB. Free memory was 55.6 MB in the beginning and 52.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,991 INFO L168 Benchmark]: RCFGBuilder took 3976.16 ms. Allocated memory was 100.7 MB in the beginning and 165.7 MB in the end (delta: 65.0 MB). Free memory was 52.8 MB in the beginning and 111.1 MB in the end (delta: -58.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,992 INFO L168 Benchmark]: TraceAbstraction took 28648.80 ms. Allocated memory was 165.7 MB in the beginning and 559.9 MB in the end (delta: 394.3 MB). Free memory was 110.1 MB in the beginning and 289.6 MB in the end (delta: -179.5 MB). Peak memory consumption was 214.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,992 INFO L168 Benchmark]: Witness Printer took 235.80 ms. Allocated memory is still 559.9 MB. Free memory was 289.6 MB in the beginning and 246.6 MB in the end (delta: 43.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:19:22,995 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.30 ms. Allocated memory is still 100.7 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 859.46 ms. Allocated memory is still 100.7 MB. Free memory was 57.6 MB in the beginning and 58.6 MB in the end (delta: -974.9 kB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.40 ms. Allocated memory is still 100.7 MB. Free memory was 58.6 MB in the beginning and 55.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.95 ms. Allocated memory is still 100.7 MB. Free memory was 55.6 MB in the beginning and 52.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3976.16 ms. Allocated memory was 100.7 MB in the beginning and 165.7 MB in the end (delta: 65.0 MB). Free memory was 52.8 MB in the beginning and 111.1 MB in the end (delta: -58.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28648.80 ms. Allocated memory was 165.7 MB in the beginning and 559.9 MB in the end (delta: 394.3 MB). Free memory was 110.1 MB in the beginning and 289.6 MB in the end (delta: -179.5 MB). Peak memory consumption was 214.8 MB. Max. memory is 16.1 GB. * Witness Printer took 235.80 ms. Allocated memory is still 559.9 MB. Free memory was 289.6 MB in the beginning and 246.6 MB in the end (delta: 43.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 pthread_t t1873; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1874; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1875; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 849]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 279 SDtfs, 944 SDslu, 1122 SDs, 0 SdLazy, 2507 SolverSat, 721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=16, InterpolantAutomatonStates: 295, 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, 1.9s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1606 NumberOfCodeBlocks, 1606 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 10609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 09:19:23,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f6e9f6-9bcc-41b6-9fc4-5c5df6a67366/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...