./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:31:43,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:31:43,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:31:43,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:31:43,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:31:43,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:31:43,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:31:43,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:31:43,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:31:43,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:31:43,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:31:43,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:31:43,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:31:43,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:31:43,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:31:43,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:31:43,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:31:43,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:31:43,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:31:43,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:31:43,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:31:43,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:31:43,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:31:43,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:31:43,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:31:43,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:31:43,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:31:43,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:31:43,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:31:43,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:31:43,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:31:43,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:31:43,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:31:43,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:31:43,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:31:43,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:31:43,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:31:43,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:31:43,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:31:43,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:31:43,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:31:43,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 23:31:43,243 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:31:43,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:31:43,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:31:43,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:31:43,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:31:43,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:31:43,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:31:43,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:31:43,245 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:31:43,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:31:43,245 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:31:43,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:31:43,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:31:43,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 23:31:43,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:31:43,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:31:43,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:31:43,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:31:43,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 23:31:43,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:31:43,253 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_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2021-12-06 23:31:43,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:31:43,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:31:43,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:31:43,436 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:31:43,436 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:31:43,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2021-12-06 23:31:43,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/data/2a48043a0/38439d9896d6409090d9864197033464/FLAG4e977e6d1 [2021-12-06 23:31:43,947 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:31:43,947 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2021-12-06 23:31:43,957 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/data/2a48043a0/38439d9896d6409090d9864197033464/FLAG4e977e6d1 [2021-12-06 23:31:44,274 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/data/2a48043a0/38439d9896d6409090d9864197033464 [2021-12-06 23:31:44,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:31:44,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:31:44,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:31:44,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:31:44,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:31:44,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c31e3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44, skipping insertion in model container [2021-12-06 23:31:44,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:31:44,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:31:44,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2021-12-06 23:31:44,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:31:44,554 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:31:44,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2021-12-06 23:31:44,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:31:44,632 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:31:44,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44 WrapperNode [2021-12-06 23:31:44,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:31:44,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:31:44,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:31:44,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:31:44,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,677 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-12-06 23:31:44,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:31:44,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:31:44,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:31:44,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:31:44,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:31:44,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:31:44,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:31:44,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:31:44,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (1/1) ... [2021-12-06 23:31:44,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:31:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:31:44,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:31:44,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:31:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 23:31:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 23:31:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:31:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 23:31:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 23:31:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 23:31:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 23:31:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:31:44,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:31:44,772 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 23:31:44,863 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:31:44,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:31:45,239 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:31:45,475 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:31:45,476 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 23:31:45,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:31:45 BoogieIcfgContainer [2021-12-06 23:31:45,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:31:45,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:31:45,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:31:45,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:31:45,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:31:44" (1/3) ... [2021-12-06 23:31:45,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59044318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:31:45, skipping insertion in model container [2021-12-06 23:31:45,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:31:44" (2/3) ... [2021-12-06 23:31:45,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59044318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:31:45, skipping insertion in model container [2021-12-06 23:31:45,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:31:45" (3/3) ... [2021-12-06 23:31:45,484 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2021-12-06 23:31:45,489 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 23:31:45,489 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:31:45,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 23:31:45,490 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 23:31:45,513 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,514 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,515 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,516 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,517 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,517 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,517 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,517 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,517 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,517 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,521 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,522 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,523 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,523 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,523 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,523 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,523 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,525 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,526 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,527 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,527 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,527 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,527 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,528 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,529 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,530 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:31:45,530 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 23:31:45,564 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:31:45,569 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 23:31:45,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-06 23:31:45,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-12-06 23:31:45,611 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-12-06 23:31:45,611 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:31:45,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-12-06 23:31:45,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-12-06 23:31:45,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-12-06 23:31:45,624 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2021-12-06 23:31:45,624 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:31:45,624 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:45,625 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] [2021-12-06 23:31:45,625 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1654950207, now seen corresponding path program 1 times [2021-12-06 23:31:45,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:45,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106342707] [2021-12-06 23:31:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:45,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:45,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:45,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106342707] [2021-12-06 23:31:45,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106342707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:45,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:45,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:31:45,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748617162] [2021-12-06 23:31:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:45,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:31:45,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:45,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:31:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:31:45,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-12-06 23:31:45,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:45,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:45,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-12-06 23:31:45,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:46,026 INFO L129 PetriNetUnfolder]: 58/326 cut-off events. [2021-12-06 23:31:46,026 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-06 23:31:46,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 326 events. 58/326 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1332 event pairs, 10 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2021-12-06 23:31:46,032 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2021-12-06 23:31:46,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2021-12-06 23:31:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:31:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 23:31:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2021-12-06 23:31:46,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2021-12-06 23:31:46,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2021-12-06 23:31:46,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2021-12-06 23:31:46,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:46,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2021-12-06 23:31:46,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,070 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2021-12-06 23:31:46,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2021-12-06 23:31:46,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 23:31:46,079 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-12-06 23:31:46,081 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-12-06 23:31:46,086 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-12-06 23:31:46,086 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-12-06 23:31:46,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,086 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:46,087 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-12-06 23:31:46,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:31:46,087 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1969702196, now seen corresponding path program 1 times [2021-12-06 23:31:46,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169855590] [2021-12-06 23:31:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:46,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:46,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-12-06 23:31:46,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:46,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169855590] [2021-12-06 23:31:46,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169855590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:46,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:46,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:31:46,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033546276] [2021-12-06 23:31:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:46,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:31:46,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:31:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:31:46,349 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-12-06 23:31:46,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:46,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-12-06 23:31:46,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:46,774 INFO L129 PetriNetUnfolder]: 515/1536 cut-off events. [2021-12-06 23:31:46,774 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-12-06 23:31:46,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2465 conditions, 1536 events. 515/1536 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11250 event pairs, 129 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 2414. Up to 472 conditions per place. [2021-12-06 23:31:46,783 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 21 selfloop transitions, 3 changer transitions 51/153 dead transitions. [2021-12-06 23:31:46,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 153 transitions, 462 flow [2021-12-06 23:31:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:31:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:31:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 894 transitions. [2021-12-06 23:31:46,790 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8713450292397661 [2021-12-06 23:31:46,790 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 894 transitions. [2021-12-06 23:31:46,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 894 transitions. [2021-12-06 23:31:46,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:46,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 894 transitions. [2021-12-06 23:31:46,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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-12-06 23:31:46,801 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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-12-06 23:31:46,801 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 894 transitions. [2021-12-06 23:31:46,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 153 transitions, 462 flow [2021-12-06 23:31:46,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 153 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 23:31:46,807 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 239 flow [2021-12-06 23:31:46,807 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2021-12-06 23:31:46,808 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-12-06 23:31:46,808 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 239 flow [2021-12-06 23:31:46,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,809 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:46,809 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-12-06 23:31:46,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:31:46,810 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -992827149, now seen corresponding path program 1 times [2021-12-06 23:31:46,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:46,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73207566] [2021-12-06 23:31:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:46,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:46,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73207566] [2021-12-06 23:31:46,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73207566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:46,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:46,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:31:46,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076378326] [2021-12-06 23:31:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:46,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:31:46,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:31:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:31:46,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2021-12-06 23:31:46,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:46,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:46,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2021-12-06 23:31:46,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:47,288 INFO L129 PetriNetUnfolder]: 424/979 cut-off events. [2021-12-06 23:31:47,288 INFO L130 PetriNetUnfolder]: For 715/722 co-relation queries the response was YES. [2021-12-06 23:31:47,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 979 events. 424/979 cut-off events. For 715/722 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5625 event pairs, 100 based on Foata normal form. 30/963 useless extension candidates. Maximal degree in co-relation 2142. Up to 295 conditions per place. [2021-12-06 23:31:47,296 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 31/132 dead transitions. [2021-12-06 23:31:47,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 429 flow [2021-12-06 23:31:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:31:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:31:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2021-12-06 23:31:47,306 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2021-12-06 23:31:47,306 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2021-12-06 23:31:47,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2021-12-06 23:31:47,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:47,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2021-12-06 23:31:47,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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-12-06 23:31:47,313 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 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-12-06 23:31:47,313 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 239 flow. Second operand 9 states and 890 transitions. [2021-12-06 23:31:47,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 429 flow [2021-12-06 23:31:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 132 transitions, 412 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-06 23:31:47,321 INFO L242 Difference]: Finished difference. Result has 122 places, 97 transitions, 250 flow [2021-12-06 23:31:47,321 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, 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=250, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2021-12-06 23:31:47,321 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2021-12-06 23:31:47,322 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 250 flow [2021-12-06 23:31:47,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,322 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:47,322 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-12-06 23:31:47,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:31:47,323 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:47,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash 588842642, now seen corresponding path program 1 times [2021-12-06 23:31:47,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:47,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739021159] [2021-12-06 23:31:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:47,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:47,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:47,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739021159] [2021-12-06 23:31:47,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739021159] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:47,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:47,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:31:47,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567230494] [2021-12-06 23:31:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:47,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:31:47,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:31:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:31:47,438 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2021-12-06 23:31:47,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:47,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2021-12-06 23:31:47,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:47,807 INFO L129 PetriNetUnfolder]: 488/1110 cut-off events. [2021-12-06 23:31:47,807 INFO L130 PetriNetUnfolder]: For 1033/1038 co-relation queries the response was YES. [2021-12-06 23:31:47,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1110 events. 488/1110 cut-off events. For 1033/1038 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6438 event pairs, 81 based on Foata normal form. 28/1079 useless extension candidates. Maximal degree in co-relation 2520. Up to 281 conditions per place. [2021-12-06 23:31:47,815 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 25 selfloop transitions, 4 changer transitions 32/140 dead transitions. [2021-12-06 23:31:47,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 140 transitions, 495 flow [2021-12-06 23:31:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:31:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:31:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2021-12-06 23:31:47,818 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8535087719298246 [2021-12-06 23:31:47,818 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2021-12-06 23:31:47,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2021-12-06 23:31:47,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:47,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2021-12-06 23:31:47,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,824 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,824 INFO L186 Difference]: Start difference. First operand has 122 places, 97 transitions, 250 flow. Second operand 10 states and 973 transitions. [2021-12-06 23:31:47,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 140 transitions, 495 flow [2021-12-06 23:31:47,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 140 transitions, 459 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-12-06 23:31:47,830 INFO L242 Difference]: Finished difference. Result has 125 places, 98 transitions, 267 flow [2021-12-06 23:31:47,830 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=267, PETRI_PLACES=125, PETRI_TRANSITIONS=98} [2021-12-06 23:31:47,831 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2021-12-06 23:31:47,831 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 98 transitions, 267 flow [2021-12-06 23:31:47,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,832 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:47,832 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-12-06 23:31:47,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:31:47,832 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 515189745, now seen corresponding path program 1 times [2021-12-06 23:31:47,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:47,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841361285] [2021-12-06 23:31:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:47,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:47,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:47,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841361285] [2021-12-06 23:31:47,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841361285] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:47,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:47,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:31:47,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396630639] [2021-12-06 23:31:47,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:47,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:31:47,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:47,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:31:47,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:31:47,980 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:31:47,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 98 transitions, 267 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:47,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:47,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:31:47,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:48,403 INFO L129 PetriNetUnfolder]: 497/1162 cut-off events. [2021-12-06 23:31:48,403 INFO L130 PetriNetUnfolder]: For 1147/1196 co-relation queries the response was YES. [2021-12-06 23:31:48,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1162 events. 497/1162 cut-off events. For 1147/1196 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6487 event pairs, 127 based on Foata normal form. 32/1115 useless extension candidates. Maximal degree in co-relation 2613. Up to 501 conditions per place. [2021-12-06 23:31:48,411 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 21 selfloop transitions, 11 changer transitions 43/154 dead transitions. [2021-12-06 23:31:48,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 154 transitions, 589 flow [2021-12-06 23:31:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:31:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 23:31:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2021-12-06 23:31:48,416 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8350877192982457 [2021-12-06 23:31:48,416 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2021-12-06 23:31:48,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2021-12-06 23:31:48,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:48,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2021-12-06 23:31:48,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:48,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:48,423 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:48,423 INFO L186 Difference]: Start difference. First operand has 125 places, 98 transitions, 267 flow. Second operand 15 states and 1428 transitions. [2021-12-06 23:31:48,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 154 transitions, 589 flow [2021-12-06 23:31:48,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 154 transitions, 545 flow, removed 20 selfloop flow, removed 8 redundant places. [2021-12-06 23:31:48,429 INFO L242 Difference]: Finished difference. Result has 136 places, 105 transitions, 352 flow [2021-12-06 23:31:48,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=352, PETRI_PLACES=136, PETRI_TRANSITIONS=105} [2021-12-06 23:31:48,430 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2021-12-06 23:31:48,430 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 105 transitions, 352 flow [2021-12-06 23:31:48,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:48,430 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:48,430 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] [2021-12-06 23:31:48,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:31:48,431 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 172582919, now seen corresponding path program 1 times [2021-12-06 23:31:48,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:48,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453153972] [2021-12-06 23:31:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:48,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:48,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:48,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453153972] [2021-12-06 23:31:48,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453153972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:48,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:48,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:31:48,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280923535] [2021-12-06 23:31:48,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:48,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:31:48,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:48,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:31:48,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:31:48,573 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:31:48,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 105 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 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-12-06 23:31:48,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:48,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:31:48,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:48,999 INFO L129 PetriNetUnfolder]: 429/1051 cut-off events. [2021-12-06 23:31:48,999 INFO L130 PetriNetUnfolder]: For 3512/3976 co-relation queries the response was YES. [2021-12-06 23:31:49,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 1051 events. 429/1051 cut-off events. For 3512/3976 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5789 event pairs, 119 based on Foata normal form. 26/1004 useless extension candidates. Maximal degree in co-relation 3635. Up to 439 conditions per place. [2021-12-06 23:31:49,009 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 31 selfloop transitions, 9 changer transitions 37/156 dead transitions. [2021-12-06 23:31:49,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 156 transitions, 880 flow [2021-12-06 23:31:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:31:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 23:31:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1424 transitions. [2021-12-06 23:31:49,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8327485380116959 [2021-12-06 23:31:49,022 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1424 transitions. [2021-12-06 23:31:49,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1424 transitions. [2021-12-06 23:31:49,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:49,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1424 transitions. [2021-12-06 23:31:49,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.93333333333334) internal successors, (1424), 15 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,033 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,033 INFO L186 Difference]: Start difference. First operand has 136 places, 105 transitions, 352 flow. Second operand 15 states and 1424 transitions. [2021-12-06 23:31:49,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 156 transitions, 880 flow [2021-12-06 23:31:49,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 156 transitions, 852 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-12-06 23:31:49,042 INFO L242 Difference]: Finished difference. Result has 146 places, 108 transitions, 422 flow [2021-12-06 23:31:49,042 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=422, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2021-12-06 23:31:49,043 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 27 predicate places. [2021-12-06 23:31:49,043 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 422 flow [2021-12-06 23:31:49,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 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-12-06 23:31:49,044 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:49,044 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-12-06 23:31:49,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:31:49,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash -440170143, now seen corresponding path program 1 times [2021-12-06 23:31:49,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:49,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820764446] [2021-12-06 23:31:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:49,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:49,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820764446] [2021-12-06 23:31:49,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820764446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:49,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:49,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:31:49,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652484840] [2021-12-06 23:31:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:49,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:31:49,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:31:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:31:49,197 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-12-06 23:31:49,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 422 flow. Second operand has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:49,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-12-06 23:31:49,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:49,561 INFO L129 PetriNetUnfolder]: 426/1056 cut-off events. [2021-12-06 23:31:49,561 INFO L130 PetriNetUnfolder]: For 7511/8224 co-relation queries the response was YES. [2021-12-06 23:31:49,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 1056 events. 426/1056 cut-off events. For 7511/8224 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6071 event pairs, 82 based on Foata normal form. 53/1043 useless extension candidates. Maximal degree in co-relation 4734. Up to 453 conditions per place. [2021-12-06 23:31:49,572 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 25 selfloop transitions, 14 changer transitions 29/145 dead transitions. [2021-12-06 23:31:49,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 145 transitions, 926 flow [2021-12-06 23:31:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:31:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 23:31:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1383 transitions. [2021-12-06 23:31:49,576 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8087719298245614 [2021-12-06 23:31:49,576 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1383 transitions. [2021-12-06 23:31:49,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1383 transitions. [2021-12-06 23:31:49,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:49,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1383 transitions. [2021-12-06 23:31:49,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 92.2) internal successors, (1383), 15 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,583 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,583 INFO L186 Difference]: Start difference. First operand has 146 places, 108 transitions, 422 flow. Second operand 15 states and 1383 transitions. [2021-12-06 23:31:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 145 transitions, 926 flow [2021-12-06 23:31:49,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 145 transitions, 876 flow, removed 21 selfloop flow, removed 9 redundant places. [2021-12-06 23:31:49,592 INFO L242 Difference]: Finished difference. Result has 149 places, 110 transitions, 480 flow [2021-12-06 23:31:49,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=480, PETRI_PLACES=149, PETRI_TRANSITIONS=110} [2021-12-06 23:31:49,592 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2021-12-06 23:31:49,593 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 110 transitions, 480 flow [2021-12-06 23:31:49,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,593 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:49,593 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-12-06 23:31:49,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:31:49,594 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1858852634, now seen corresponding path program 1 times [2021-12-06 23:31:49,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024160050] [2021-12-06 23:31:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:49,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:49,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:49,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024160050] [2021-12-06 23:31:49,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024160050] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:49,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:49,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:31:49,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772154800] [2021-12-06 23:31:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:49,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:31:49,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:49,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:31:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:31:49,736 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:31:49,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 110 transitions, 480 flow. Second operand has 11 states, 11 states have (on average 91.45454545454545) internal successors, (1006), 11 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:49,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:49,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:31:49,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:50,202 INFO L129 PetriNetUnfolder]: 345/930 cut-off events. [2021-12-06 23:31:50,203 INFO L130 PetriNetUnfolder]: For 10589/11179 co-relation queries the response was YES. [2021-12-06 23:31:50,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 930 events. 345/930 cut-off events. For 10589/11179 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5209 event pairs, 115 based on Foata normal form. 25/882 useless extension candidates. Maximal degree in co-relation 4781. Up to 414 conditions per place. [2021-12-06 23:31:50,213 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 35 selfloop transitions, 12 changer transitions 25/151 dead transitions. [2021-12-06 23:31:50,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 1175 flow [2021-12-06 23:31:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:31:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 23:31:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1412 transitions. [2021-12-06 23:31:50,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8257309941520468 [2021-12-06 23:31:50,217 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1412 transitions. [2021-12-06 23:31:50,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1412 transitions. [2021-12-06 23:31:50,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:50,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1412 transitions. [2021-12-06 23:31:50,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.13333333333334) internal successors, (1412), 15 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,224 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,224 INFO L186 Difference]: Start difference. First operand has 149 places, 110 transitions, 480 flow. Second operand 15 states and 1412 transitions. [2021-12-06 23:31:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 1175 flow [2021-12-06 23:31:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 151 transitions, 1110 flow, removed 22 selfloop flow, removed 10 redundant places. [2021-12-06 23:31:50,232 INFO L242 Difference]: Finished difference. Result has 157 places, 115 transitions, 547 flow [2021-12-06 23:31:50,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=547, PETRI_PLACES=157, PETRI_TRANSITIONS=115} [2021-12-06 23:31:50,233 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 38 predicate places. [2021-12-06 23:31:50,233 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 115 transitions, 547 flow [2021-12-06 23:31:50,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.45454545454545) internal successors, (1006), 11 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,234 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:50,234 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-12-06 23:31:50,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:31:50,234 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -686733754, now seen corresponding path program 2 times [2021-12-06 23:31:50,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302246401] [2021-12-06 23:31:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:50,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:50,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302246401] [2021-12-06 23:31:50,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302246401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:50,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:50,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:31:50,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066252917] [2021-12-06 23:31:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:50,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:31:50,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:31:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:31:50,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2021-12-06 23:31:50,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 115 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:50,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2021-12-06 23:31:50,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:50,718 INFO L129 PetriNetUnfolder]: 340/914 cut-off events. [2021-12-06 23:31:50,718 INFO L130 PetriNetUnfolder]: For 15279/16166 co-relation queries the response was YES. [2021-12-06 23:31:50,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5346 conditions, 914 events. 340/914 cut-off events. For 15279/16166 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5010 event pairs, 108 based on Foata normal form. 39/882 useless extension candidates. Maximal degree in co-relation 5250. Up to 401 conditions per place. [2021-12-06 23:31:50,729 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 33 selfloop transitions, 11 changer transitions 25/149 dead transitions. [2021-12-06 23:31:50,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 149 transitions, 1248 flow [2021-12-06 23:31:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:31:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 23:31:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1150 transitions. [2021-12-06 23:31:50,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8406432748538012 [2021-12-06 23:31:50,732 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1150 transitions. [2021-12-06 23:31:50,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1150 transitions. [2021-12-06 23:31:50,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:50,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1150 transitions. [2021-12-06 23:31:50,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.83333333333333) internal successors, (1150), 12 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,738 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,739 INFO L186 Difference]: Start difference. First operand has 157 places, 115 transitions, 547 flow. Second operand 12 states and 1150 transitions. [2021-12-06 23:31:50,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 149 transitions, 1248 flow [2021-12-06 23:31:50,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1003 flow, removed 116 selfloop flow, removed 15 redundant places. [2021-12-06 23:31:50,757 INFO L242 Difference]: Finished difference. Result has 152 places, 117 transitions, 520 flow [2021-12-06 23:31:50,757 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=520, PETRI_PLACES=152, PETRI_TRANSITIONS=117} [2021-12-06 23:31:50,758 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2021-12-06 23:31:50,758 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 117 transitions, 520 flow [2021-12-06 23:31:50,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:50,759 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] [2021-12-06 23:31:50,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:31:50,759 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash -72150787, now seen corresponding path program 1 times [2021-12-06 23:31:50,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:50,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041942660] [2021-12-06 23:31:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:50,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:50,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:50,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041942660] [2021-12-06 23:31:50,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041942660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:50,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:50,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 23:31:50,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282901602] [2021-12-06 23:31:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:50,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:31:50,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:31:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:31:50,952 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-06 23:31:50,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 117 transitions, 520 flow. Second operand has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:50,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:50,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-06 23:31:50,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:51,317 INFO L129 PetriNetUnfolder]: 304/850 cut-off events. [2021-12-06 23:31:51,317 INFO L130 PetriNetUnfolder]: For 6826/8233 co-relation queries the response was YES. [2021-12-06 23:31:51,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 850 events. 304/850 cut-off events. For 6826/8233 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4743 event pairs, 67 based on Foata normal form. 64/859 useless extension candidates. Maximal degree in co-relation 3937. Up to 388 conditions per place. [2021-12-06 23:31:51,326 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 35 selfloop transitions, 15 changer transitions 22/148 dead transitions. [2021-12-06 23:31:51,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 148 transitions, 994 flow [2021-12-06 23:31:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:31:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 23:31:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1450 transitions. [2021-12-06 23:31:51,329 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7949561403508771 [2021-12-06 23:31:51,330 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1450 transitions. [2021-12-06 23:31:51,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1450 transitions. [2021-12-06 23:31:51,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:51,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1450 transitions. [2021-12-06 23:31:51,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 90.625) internal successors, (1450), 16 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,335 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,335 INFO L186 Difference]: Start difference. First operand has 152 places, 117 transitions, 520 flow. Second operand 16 states and 1450 transitions. [2021-12-06 23:31:51,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 148 transitions, 994 flow [2021-12-06 23:31:51,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 148 transitions, 933 flow, removed 25 selfloop flow, removed 12 redundant places. [2021-12-06 23:31:51,342 INFO L242 Difference]: Finished difference. Result has 156 places, 119 transitions, 574 flow [2021-12-06 23:31:51,343 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=574, PETRI_PLACES=156, PETRI_TRANSITIONS=119} [2021-12-06 23:31:51,343 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2021-12-06 23:31:51,343 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 119 transitions, 574 flow [2021-12-06 23:31:51,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,344 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:51,344 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] [2021-12-06 23:31:51,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:31:51,344 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1185387351, now seen corresponding path program 1 times [2021-12-06 23:31:51,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:51,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405327972] [2021-12-06 23:31:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:51,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:51,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:51,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405327972] [2021-12-06 23:31:51,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405327972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:51,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:51,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:31:51,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32900409] [2021-12-06 23:31:51,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:51,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:31:51,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:31:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:31:51,444 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2021-12-06 23:31:51,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 119 transitions, 574 flow. Second operand has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:51,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2021-12-06 23:31:51,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:51,764 INFO L129 PetriNetUnfolder]: 358/1008 cut-off events. [2021-12-06 23:31:51,764 INFO L130 PetriNetUnfolder]: For 9525/11367 co-relation queries the response was YES. [2021-12-06 23:31:51,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5094 conditions, 1008 events. 358/1008 cut-off events. For 9525/11367 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6181 event pairs, 70 based on Foata normal form. 40/985 useless extension candidates. Maximal degree in co-relation 4999. Up to 370 conditions per place. [2021-12-06 23:31:51,774 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 33 selfloop transitions, 14 changer transitions 25/152 dead transitions. [2021-12-06 23:31:51,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 152 transitions, 1202 flow [2021-12-06 23:31:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:31:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:31:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1055 transitions. [2021-12-06 23:31:51,776 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8413078149920256 [2021-12-06 23:31:51,776 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1055 transitions. [2021-12-06 23:31:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1055 transitions. [2021-12-06 23:31:51,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:51,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1055 transitions. [2021-12-06 23:31:51,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.9090909090909) internal successors, (1055), 11 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,779 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,779 INFO L186 Difference]: Start difference. First operand has 156 places, 119 transitions, 574 flow. Second operand 11 states and 1055 transitions. [2021-12-06 23:31:51,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 152 transitions, 1202 flow [2021-12-06 23:31:51,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 152 transitions, 1073 flow, removed 53 selfloop flow, removed 14 redundant places. [2021-12-06 23:31:51,789 INFO L242 Difference]: Finished difference. Result has 153 places, 122 transitions, 639 flow [2021-12-06 23:31:51,790 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=639, PETRI_PLACES=153, PETRI_TRANSITIONS=122} [2021-12-06 23:31:51,790 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 34 predicate places. [2021-12-06 23:31:51,790 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 122 transitions, 639 flow [2021-12-06 23:31:51,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,790 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:51,791 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-12-06 23:31:51,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:31:51,791 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1120331008, now seen corresponding path program 1 times [2021-12-06 23:31:51,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:51,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137165517] [2021-12-06 23:31:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:51,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:51,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:51,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137165517] [2021-12-06 23:31:51,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137165517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:51,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:51,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:31:51,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980345034] [2021-12-06 23:31:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:51,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:31:51,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:51,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:31:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:31:51,857 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:31:51,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 122 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:51,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:51,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:31:51,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:52,585 INFO L129 PetriNetUnfolder]: 2568/4726 cut-off events. [2021-12-06 23:31:52,586 INFO L130 PetriNetUnfolder]: For 70096/72079 co-relation queries the response was YES. [2021-12-06 23:31:52,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23154 conditions, 4726 events. 2568/4726 cut-off events. For 70096/72079 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 34741 event pairs, 72 based on Foata normal form. 343/4855 useless extension candidates. Maximal degree in co-relation 23065. Up to 1416 conditions per place. [2021-12-06 23:31:52,620 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 89 selfloop transitions, 13 changer transitions 70/254 dead transitions. [2021-12-06 23:31:52,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 254 transitions, 2437 flow [2021-12-06 23:31:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:31:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:31:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2021-12-06 23:31:52,623 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2021-12-06 23:31:52,623 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2021-12-06 23:31:52,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2021-12-06 23:31:52,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:52,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2021-12-06 23:31:52,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:52,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:52,627 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:52,627 INFO L186 Difference]: Start difference. First operand has 153 places, 122 transitions, 639 flow. Second operand 10 states and 982 transitions. [2021-12-06 23:31:52,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 254 transitions, 2437 flow [2021-12-06 23:31:52,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 254 transitions, 2338 flow, removed 27 selfloop flow, removed 6 redundant places. [2021-12-06 23:31:52,654 INFO L242 Difference]: Finished difference. Result has 156 places, 131 transitions, 694 flow [2021-12-06 23:31:52,655 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=694, PETRI_PLACES=156, PETRI_TRANSITIONS=131} [2021-12-06 23:31:52,655 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2021-12-06 23:31:52,655 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 131 transitions, 694 flow [2021-12-06 23:31:52,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:52,656 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:52,656 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:31:52,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 23:31:52,656 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1050244152, now seen corresponding path program 1 times [2021-12-06 23:31:52,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331896174] [2021-12-06 23:31:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:52,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:52,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:52,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331896174] [2021-12-06 23:31:52,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331896174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:52,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:52,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:31:52,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769880656] [2021-12-06 23:31:52,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:52,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:31:52,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:31:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:31:52,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:31:52,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 131 transitions, 694 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:52,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:52,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:31:52,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:53,590 INFO L129 PetriNetUnfolder]: 2172/4263 cut-off events. [2021-12-06 23:31:53,590 INFO L130 PetriNetUnfolder]: For 63099/64602 co-relation queries the response was YES. [2021-12-06 23:31:53,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22605 conditions, 4263 events. 2172/4263 cut-off events. For 63099/64602 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 33209 event pairs, 77 based on Foata normal form. 375/4519 useless extension candidates. Maximal degree in co-relation 22513. Up to 1117 conditions per place. [2021-12-06 23:31:53,612 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 98 selfloop transitions, 24 changer transitions 64/267 dead transitions. [2021-12-06 23:31:53,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 267 transitions, 2691 flow [2021-12-06 23:31:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:31:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 23:31:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1275 transitions. [2021-12-06 23:31:53,614 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8603238866396761 [2021-12-06 23:31:53,614 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1275 transitions. [2021-12-06 23:31:53,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1275 transitions. [2021-12-06 23:31:53,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:53,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1275 transitions. [2021-12-06 23:31:53,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.07692307692308) internal successors, (1275), 13 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:53,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:53,617 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:53,617 INFO L186 Difference]: Start difference. First operand has 156 places, 131 transitions, 694 flow. Second operand 13 states and 1275 transitions. [2021-12-06 23:31:53,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 267 transitions, 2691 flow [2021-12-06 23:31:53,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 267 transitions, 2588 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-12-06 23:31:53,664 INFO L242 Difference]: Finished difference. Result has 168 places, 140 transitions, 820 flow [2021-12-06 23:31:53,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=820, PETRI_PLACES=168, PETRI_TRANSITIONS=140} [2021-12-06 23:31:53,665 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 49 predicate places. [2021-12-06 23:31:53,665 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 140 transitions, 820 flow [2021-12-06 23:31:53,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:53,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:53,665 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:31:53,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 23:31:53,665 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1617209921, now seen corresponding path program 1 times [2021-12-06 23:31:53,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:53,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345136044] [2021-12-06 23:31:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:53,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:53,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:53,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345136044] [2021-12-06 23:31:53,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345136044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:53,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:53,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:31:53,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418872470] [2021-12-06 23:31:53,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:53,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:31:53,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:53,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:31:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:31:53,740 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:31:53,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 140 transitions, 820 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:53,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:53,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:31:53,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:54,579 INFO L129 PetriNetUnfolder]: 1949/4010 cut-off events. [2021-12-06 23:31:54,579 INFO L130 PetriNetUnfolder]: For 62916/64381 co-relation queries the response was YES. [2021-12-06 23:31:54,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22676 conditions, 4010 events. 1949/4010 cut-off events. For 62916/64381 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 33226 event pairs, 58 based on Foata normal form. 293/4185 useless extension candidates. Maximal degree in co-relation 22580. Up to 1079 conditions per place. [2021-12-06 23:31:54,601 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 85 selfloop transitions, 28 changer transitions 64/258 dead transitions. [2021-12-06 23:31:54,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 258 transitions, 2525 flow [2021-12-06 23:31:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:31:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 23:31:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1534 transitions. [2021-12-06 23:31:54,603 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8410087719298246 [2021-12-06 23:31:54,603 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1534 transitions. [2021-12-06 23:31:54,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1534 transitions. [2021-12-06 23:31:54,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:54,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1534 transitions. [2021-12-06 23:31:54,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.875) internal successors, (1534), 16 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:54,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:54,607 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:54,607 INFO L186 Difference]: Start difference. First operand has 168 places, 140 transitions, 820 flow. Second operand 16 states and 1534 transitions. [2021-12-06 23:31:54,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 258 transitions, 2525 flow [2021-12-06 23:31:54,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 258 transitions, 2187 flow, removed 147 selfloop flow, removed 10 redundant places. [2021-12-06 23:31:54,698 INFO L242 Difference]: Finished difference. Result has 180 places, 140 transitions, 760 flow [2021-12-06 23:31:54,698 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=760, PETRI_PLACES=180, PETRI_TRANSITIONS=140} [2021-12-06 23:31:54,698 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2021-12-06 23:31:54,698 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 140 transitions, 760 flow [2021-12-06 23:31:54,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:54,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:54,699 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:31:54,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 23:31:54,699 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash -141515640, now seen corresponding path program 1 times [2021-12-06 23:31:54,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:54,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150536760] [2021-12-06 23:31:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:54,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:31:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:31:54,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:31:54,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150536760] [2021-12-06 23:31:54,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150536760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:31:54,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:31:54,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 23:31:54,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470168239] [2021-12-06 23:31:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:31:54,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 23:31:54,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:31:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 23:31:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-06 23:31:54,918 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2021-12-06 23:31:54,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 140 transitions, 760 flow. Second operand has 14 states, 14 states have (on average 86.71428571428571) internal successors, (1214), 14 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:54,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:31:54,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2021-12-06 23:31:54,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:31:55,290 INFO L129 PetriNetUnfolder]: 286/1874 cut-off events. [2021-12-06 23:31:55,290 INFO L130 PetriNetUnfolder]: For 6717/7055 co-relation queries the response was YES. [2021-12-06 23:31:55,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 1874 events. 286/1874 cut-off events. For 6717/7055 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 21062 event pairs, 1 based on Foata normal form. 22/1792 useless extension candidates. Maximal degree in co-relation 6126. Up to 259 conditions per place. [2021-12-06 23:31:55,304 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 33 selfloop transitions, 11 changer transitions 12/157 dead transitions. [2021-12-06 23:31:55,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 157 transitions, 1058 flow [2021-12-06 23:31:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:31:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:31:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 977 transitions. [2021-12-06 23:31:55,305 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7791068580542265 [2021-12-06 23:31:55,305 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 977 transitions. [2021-12-06 23:31:55,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 977 transitions. [2021-12-06 23:31:55,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:31:55,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 977 transitions. [2021-12-06 23:31:55,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.81818181818181) internal successors, (977), 11 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-12-06 23:31:55,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:55,307 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:55,307 INFO L186 Difference]: Start difference. First operand has 180 places, 140 transitions, 760 flow. Second operand 11 states and 977 transitions. [2021-12-06 23:31:55,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 157 transitions, 1058 flow [2021-12-06 23:31:55,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 157 transitions, 830 flow, removed 84 selfloop flow, removed 24 redundant places. [2021-12-06 23:31:55,344 INFO L242 Difference]: Finished difference. Result has 167 places, 139 transitions, 642 flow [2021-12-06 23:31:55,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=642, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2021-12-06 23:31:55,345 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2021-12-06 23:31:55,345 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 642 flow [2021-12-06 23:31:55,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.71428571428571) internal successors, (1214), 14 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:31:55,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:31:55,345 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:31:55,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 23:31:55,345 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:31:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:31:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1425957744, now seen corresponding path program 2 times [2021-12-06 23:31:55,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:31:55,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410719190] [2021-12-06 23:31:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:31:55,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:31:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:31:55,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 23:31:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:31:55,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 23:31:55,503 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 23:31:55,504 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-06 23:31:55,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-06 23:31:55,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-06 23:31:55,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-06 23:31:55,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-06 23:31:55,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-06 23:31:55,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 23:31:55,509 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:31:55,513 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 23:31:55,513 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 23:31:55,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 11:31:55 BasicIcfg [2021-12-06 23:31:55,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 23:31:55,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 23:31:55,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 23:31:55,611 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 23:31:55,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:31:45" (3/4) ... [2021-12-06 23:31:55,613 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 23:31:55,702 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 23:31:55,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 23:31:55,703 INFO L158 Benchmark]: Toolchain (without parser) took 11425.92ms. Allocated memory was 75.5MB in the beginning and 631.2MB in the end (delta: 555.7MB). Free memory was 47.4MB in the beginning and 432.4MB in the end (delta: -385.0MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,703 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 23:31:55,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.42ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 47.3MB in the beginning and 70.0MB in the end (delta: -22.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 111.1MB. Free memory was 70.0MB in the beginning and 66.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,704 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 111.1MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,705 INFO L158 Benchmark]: RCFGBuilder took 771.07ms. Allocated memory is still 111.1MB. Free memory was 64.8MB in the beginning and 66.4MB in the end (delta: -1.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,705 INFO L158 Benchmark]: TraceAbstraction took 10131.83ms. Allocated memory was 111.1MB in the beginning and 631.2MB in the end (delta: 520.1MB). Free memory was 65.9MB in the beginning and 460.7MB in the end (delta: -394.9MB). Peak memory consumption was 191.4MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,705 INFO L158 Benchmark]: Witness Printer took 91.48ms. Allocated memory is still 631.2MB. Free memory was 460.7MB in the beginning and 432.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-06 23:31:55,707 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.19ms. Allocated memory is still 75.5MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.42ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 47.3MB in the beginning and 70.0MB in the end (delta: -22.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 111.1MB. Free memory was 70.0MB in the beginning and 66.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 111.1MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 771.07ms. Allocated memory is still 111.1MB. Free memory was 64.8MB in the beginning and 66.4MB in the end (delta: -1.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10131.83ms. Allocated memory was 111.1MB in the beginning and 631.2MB in the end (delta: 520.1MB). Free memory was 65.9MB in the beginning and 460.7MB in the end (delta: -394.9MB). Peak memory consumption was 191.4MB. Max. memory is 16.1GB. * Witness Printer took 91.48ms. Allocated memory is still 631.2MB. Free memory was 460.7MB in the beginning and 432.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=7, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=8, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=9, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 821]: 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: 819]: 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, 141 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: 9.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 823 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 823 mSDsluCounter, 652 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2031 IncrementalHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 130 mSDtfsCounter, 2031 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=820occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1254 NumberOfCodeBlocks, 1254 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1151 ConstructedInterpolants, 0 QuantifiedInterpolants, 6656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 23:31:55,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92610fc9-f886-47d4-aa24-0cbc48279160/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE