./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be --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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:42:16,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:42:16,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:42:16,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:42:16,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:42:16,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:42:16,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:42:16,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:42:16,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:42:16,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:42:16,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:42:16,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:42:16,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:42:16,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:42:16,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:42:16,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:42:16,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:42:16,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:42:16,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:42:16,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:42:16,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:42:16,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:42:16,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:42:16,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:42:16,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:42:16,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:42:16,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:42:16,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:42:16,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:42:16,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:42:16,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:42:16,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:42:16,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:42:16,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:42:16,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:42:16,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:42:16,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:42:16,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:42:16,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:42:16,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:42:16,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:42:16,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:42:16,167 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:42:16,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:42:16,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:42:16,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:42:16,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:42:16,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:42:16,169 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:42:16,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:42:16,170 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:42:16,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:42:16,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:42:16,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:42:16,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:42:16,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:42:16,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:42:16,172 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:42:16,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:42:16,173 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:42:16,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:42:16,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:42:16,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:42:16,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:42:16,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:42:16,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:42:16,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:42:16,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:42:16,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:42:16,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:42:16,176 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:42:16,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:42:16,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:42:16,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:42:16,177 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_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/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_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2021-10-21 19:42:16,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:42:16,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:42:16,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:42:16,420 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:42:16,420 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:42:16,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-10-21 19:42:16,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/data/f2340574e/97a7649adb1b40ac815fa69fb5fcef90/FLAG665ff5e0e [2021-10-21 19:42:17,139 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:42:17,145 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-10-21 19:42:17,169 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/data/f2340574e/97a7649adb1b40ac815fa69fb5fcef90/FLAG665ff5e0e [2021-10-21 19:42:17,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/data/f2340574e/97a7649adb1b40ac815fa69fb5fcef90 [2021-10-21 19:42:17,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:42:17,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:42:17,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:42:17,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:42:17,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:42:17,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:17,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2238879f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17, skipping insertion in model container [2021-10-21 19:42:17,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:17,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:42:17,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:42:17,590 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-10-21 19:42:17,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:42:17,789 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:42:17,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-10-21 19:42:17,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:42:17,941 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:42:17,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17 WrapperNode [2021-10-21 19:42:17,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:42:17,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:42:17,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:42:17,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:42:17,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:17,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:42:18,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:42:18,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:42:18,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:42:18,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:42:18,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:42:18,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:42:18,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:42:18,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (1/1) ... [2021-10-21 19:42:18,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:42:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:18,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:18,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:42:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:42:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-21 19:42:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:42:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:42:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-21 19:42:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-21 19:42:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-21 19:42:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-21 19:42:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:42:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-21 19:42:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:42:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:42:18,154 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-21 19:42:19,863 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:42:19,864 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-21 19:42:19,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:19 BoogieIcfgContainer [2021-10-21 19:42:19,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:42:19,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:42:19,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:42:19,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:42:19,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:42:17" (1/3) ... [2021-10-21 19:42:19,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6688c2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:42:19, skipping insertion in model container [2021-10-21 19:42:19,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:17" (2/3) ... [2021-10-21 19:42:19,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6688c2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:42:19, skipping insertion in model container [2021-10-21 19:42:19,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:19" (3/3) ... [2021-10-21 19:42:19,888 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2021-10-21 19:42:19,893 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-21 19:42:19,893 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:42:19,894 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 19:42:19,894 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-21 19:42:19,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,927 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,932 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,934 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,934 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,935 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,935 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,943 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,943 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:42:19,951 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-21 19:42:20,000 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:42:20,006 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:42:20,007 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-21 19:42:20,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-10-21 19:42:20,057 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-10-21 19:42:20,058 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:42:20,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-10-21 19:42:20,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-10-21 19:42:20,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-10-21 19:42:20,081 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-10-21 19:42:20,081 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:42:20,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:20,082 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-10-21 19:42:20,083 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash -983988078, now seen corresponding path program 1 times [2021-10-21 19:42:20,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:20,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797027211] [2021-10-21 19:42:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:20,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:20,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:20,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797027211] [2021-10-21 19:42:20,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797027211] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:20,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:20,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:42:20,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606155097] [2021-10-21 19:42:20,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:42:20,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:42:20,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:42:20,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-10-21 19:42:20,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:20,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-10-21 19:42:20,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:20,678 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2021-10-21 19:42:20,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:42:20,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 185 events. 16/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 597 event pairs, 6 based on Foata normal form. 9/183 useless extension candidates. Maximal degree in co-relation 185. Up to 27 conditions per place. [2021-10-21 19:42:20,685 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-10-21 19:42:20,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-10-21 19:42:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:42:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-21 19:42:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-10-21 19:42:20,703 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-10-21 19:42:20,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-10-21 19:42:20,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-10-21 19:42:20,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:20,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-10-21 19:42:20,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,727 INFO L186 Difference]: Start difference. First operand has 88 places, 83 transitions, 172 flow. Second operand 3 states and 239 transitions. [2021-10-21 19:42:20,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 188 flow [2021-10-21 19:42:20,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-21 19:42:20,739 INFO L242 Difference]: Finished difference. Result has 86 places, 79 transitions, 166 flow [2021-10-21 19:42:20,742 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2021-10-21 19:42:20,743 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, -2 predicate places. [2021-10-21 19:42:20,743 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 166 flow [2021-10-21 19:42:20,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,744 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:20,744 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:42:20,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:42:20,746 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash -260033218, now seen corresponding path program 1 times [2021-10-21 19:42:20,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:20,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2476942] [2021-10-21 19:42:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:20,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:20,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:20,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2476942] [2021-10-21 19:42:20,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2476942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:20,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:20,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:20,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664853503] [2021-10-21 19:42:20,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:20,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:20,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:20,978 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-21 19:42:20,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:20,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-21 19:42:20,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:21,220 INFO L129 PetriNetUnfolder]: 30/236 cut-off events. [2021-10-21 19:42:21,220 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:42:21,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 236 events. 30/236 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 993 event pairs, 6 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 275. Up to 36 conditions per place. [2021-10-21 19:42:21,223 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 8 selfloop transitions, 3 changer transitions 29/102 dead transitions. [2021-10-21 19:42:21,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 278 flow [2021-10-21 19:42:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:42:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 19:42:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-10-21 19:42:21,228 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-10-21 19:42:21,228 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-10-21 19:42:21,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-10-21 19:42:21,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:21,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-10-21 19:42:21,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,236 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,236 INFO L186 Difference]: Start difference. First operand has 86 places, 79 transitions, 166 flow. Second operand 9 states and 683 transitions. [2021-10-21 19:42:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 278 flow [2021-10-21 19:42:21,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 102 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-21 19:42:21,240 INFO L242 Difference]: Finished difference. Result has 99 places, 73 transitions, 189 flow [2021-10-21 19:42:21,240 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2021-10-21 19:42:21,241 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2021-10-21 19:42:21,241 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 189 flow [2021-10-21 19:42:21,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:21,242 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] [2021-10-21 19:42:21,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:42:21,243 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -81606177, now seen corresponding path program 1 times [2021-10-21 19:42:21,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:21,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318311611] [2021-10-21 19:42:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:21,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:21,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:21,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318311611] [2021-10-21 19:42:21,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318311611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:21,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:21,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:42:21,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859928919] [2021-10-21 19:42:21,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:42:21,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:42:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:21,641 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-10-21 19:42:21,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 189 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:21,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-10-21 19:42:21,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:22,056 INFO L129 PetriNetUnfolder]: 138/390 cut-off events. [2021-10-21 19:42:22,056 INFO L130 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2021-10-21 19:42:22,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 390 events. 138/390 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1792 event pairs, 59 based on Foata normal form. 14/395 useless extension candidates. Maximal degree in co-relation 854. Up to 129 conditions per place. [2021-10-21 19:42:22,062 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 13 selfloop transitions, 9 changer transitions 35/114 dead transitions. [2021-10-21 19:42:22,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 114 transitions, 413 flow [2021-10-21 19:42:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-21 19:42:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-21 19:42:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1084 transitions. [2021-10-21 19:42:22,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7970588235294118 [2021-10-21 19:42:22,071 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1084 transitions. [2021-10-21 19:42:22,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1084 transitions. [2021-10-21 19:42:22,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:22,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1084 transitions. [2021-10-21 19:42:22,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 67.75) internal successors, (1084), 16 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,082 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,082 INFO L186 Difference]: Start difference. First operand has 99 places, 73 transitions, 189 flow. Second operand 16 states and 1084 transitions. [2021-10-21 19:42:22,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 114 transitions, 413 flow [2021-10-21 19:42:22,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 114 transitions, 392 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-10-21 19:42:22,092 INFO L242 Difference]: Finished difference. Result has 107 places, 77 transitions, 254 flow [2021-10-21 19:42:22,092 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=254, PETRI_PLACES=107, PETRI_TRANSITIONS=77} [2021-10-21 19:42:22,092 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2021-10-21 19:42:22,093 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 77 transitions, 254 flow [2021-10-21 19:42:22,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,093 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:22,093 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] [2021-10-21 19:42:22,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:42:22,094 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash 581602826, now seen corresponding path program 1 times [2021-10-21 19:42:22,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:22,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310818850] [2021-10-21 19:42:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:22,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:22,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:22,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310818850] [2021-10-21 19:42:22,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310818850] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:22,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:22,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:42:22,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415197655] [2021-10-21 19:42:22,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:42:22,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:42:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:42:22,338 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-10-21 19:42:22,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 77 transitions, 254 flow. Second operand has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:22,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-10-21 19:42:22,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:22,786 INFO L129 PetriNetUnfolder]: 102/364 cut-off events. [2021-10-21 19:42:22,786 INFO L130 PetriNetUnfolder]: For 1027/1030 co-relation queries the response was YES. [2021-10-21 19:42:22,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 364 events. 102/364 cut-off events. For 1027/1030 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1736 event pairs, 6 based on Foata normal form. 9/364 useless extension candidates. Maximal degree in co-relation 1060. Up to 106 conditions per place. [2021-10-21 19:42:22,791 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 20 selfloop transitions, 7 changer transitions 25/112 dead transitions. [2021-10-21 19:42:22,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 592 flow [2021-10-21 19:42:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:42:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 19:42:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 923 transitions. [2021-10-21 19:42:22,796 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2021-10-21 19:42:22,796 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 923 transitions. [2021-10-21 19:42:22,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 923 transitions. [2021-10-21 19:42:22,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:22,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 923 transitions. [2021-10-21 19:42:22,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.0) internal successors, (923), 13 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,804 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,804 INFO L186 Difference]: Start difference. First operand has 107 places, 77 transitions, 254 flow. Second operand 13 states and 923 transitions. [2021-10-21 19:42:22,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 592 flow [2021-10-21 19:42:22,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 562 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-10-21 19:42:22,813 INFO L242 Difference]: Finished difference. Result has 114 places, 80 transitions, 304 flow [2021-10-21 19:42:22,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=304, PETRI_PLACES=114, PETRI_TRANSITIONS=80} [2021-10-21 19:42:22,814 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2021-10-21 19:42:22,814 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 80 transitions, 304 flow [2021-10-21 19:42:22,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:22,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:22,815 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] [2021-10-21 19:42:22,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:42:22,816 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1565276866, now seen corresponding path program 2 times [2021-10-21 19:42:22,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:22,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167596685] [2021-10-21 19:42:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:22,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:23,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:23,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167596685] [2021-10-21 19:42:23,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167596685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:23,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:23,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:42:23,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714202195] [2021-10-21 19:42:23,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:42:23,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:42:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:23,033 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-10-21 19:42:23,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 80 transitions, 304 flow. Second operand has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:23,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-10-21 19:42:23,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:23,355 INFO L129 PetriNetUnfolder]: 93/290 cut-off events. [2021-10-21 19:42:23,355 INFO L130 PetriNetUnfolder]: For 1583/1619 co-relation queries the response was YES. [2021-10-21 19:42:23,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 290 events. 93/290 cut-off events. For 1583/1619 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1097 event pairs, 22 based on Foata normal form. 13/297 useless extension candidates. Maximal degree in co-relation 1150. Up to 101 conditions per place. [2021-10-21 19:42:23,360 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 18 selfloop transitions, 7 changer transitions 19/102 dead transitions. [2021-10-21 19:42:23,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 102 transitions, 606 flow [2021-10-21 19:42:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:42:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-21 19:42:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 821 transitions. [2021-10-21 19:42:23,364 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8049019607843138 [2021-10-21 19:42:23,364 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 821 transitions. [2021-10-21 19:42:23,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 821 transitions. [2021-10-21 19:42:23,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:23,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 821 transitions. [2021-10-21 19:42:23,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 68.41666666666667) internal successors, (821), 12 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,371 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,371 INFO L186 Difference]: Start difference. First operand has 114 places, 80 transitions, 304 flow. Second operand 12 states and 821 transitions. [2021-10-21 19:42:23,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 102 transitions, 606 flow [2021-10-21 19:42:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 555 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-10-21 19:42:23,379 INFO L242 Difference]: Finished difference. Result has 116 places, 80 transitions, 309 flow [2021-10-21 19:42:23,379 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=309, PETRI_PLACES=116, PETRI_TRANSITIONS=80} [2021-10-21 19:42:23,380 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-10-21 19:42:23,380 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 80 transitions, 309 flow [2021-10-21 19:42:23,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,381 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:23,381 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] [2021-10-21 19:42:23,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:42:23,381 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 149924735, now seen corresponding path program 1 times [2021-10-21 19:42:23,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:23,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748036711] [2021-10-21 19:42:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:23,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:23,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:23,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748036711] [2021-10-21 19:42:23,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748036711] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:23,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:23,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:23,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431897365] [2021-10-21 19:42:23,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:23,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:23,506 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-21 19:42:23,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 80 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:23,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-21 19:42:23,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:23,667 INFO L129 PetriNetUnfolder]: 60/316 cut-off events. [2021-10-21 19:42:23,667 INFO L130 PetriNetUnfolder]: For 1616/1656 co-relation queries the response was YES. [2021-10-21 19:42:23,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 316 events. 60/316 cut-off events. For 1616/1656 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1598 event pairs, 25 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 1099. Up to 49 conditions per place. [2021-10-21 19:42:23,672 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 13 selfloop transitions, 6 changer transitions 6/94 dead transitions. [2021-10-21 19:42:23,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 94 transitions, 505 flow [2021-10-21 19:42:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:42:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 19:42:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 674 transitions. [2021-10-21 19:42:23,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810457516339869 [2021-10-21 19:42:23,676 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 674 transitions. [2021-10-21 19:42:23,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 674 transitions. [2021-10-21 19:42:23,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:23,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 674 transitions. [2021-10-21 19:42:23,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.88888888888889) internal successors, (674), 9 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,682 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,682 INFO L186 Difference]: Start difference. First operand has 116 places, 80 transitions, 309 flow. Second operand 9 states and 674 transitions. [2021-10-21 19:42:23,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 94 transitions, 505 flow [2021-10-21 19:42:23,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 94 transitions, 420 flow, removed 37 selfloop flow, removed 13 redundant places. [2021-10-21 19:42:23,689 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 335 flow [2021-10-21 19:42:23,690 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=335, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2021-10-21 19:42:23,690 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 24 predicate places. [2021-10-21 19:42:23,690 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 335 flow [2021-10-21 19:42:23,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,691 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:23,691 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] [2021-10-21 19:42:23,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:42:23,691 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash -857863622, now seen corresponding path program 1 times [2021-10-21 19:42:23,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:23,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296949101] [2021-10-21 19:42:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:23,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:24,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:24,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296949101] [2021-10-21 19:42:24,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296949101] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:24,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:24,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:42:24,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043942611] [2021-10-21 19:42:24,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:42:24,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:42:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:24,011 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-10-21 19:42:24,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 335 flow. Second operand has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:24,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-10-21 19:42:24,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:24,304 INFO L129 PetriNetUnfolder]: 136/429 cut-off events. [2021-10-21 19:42:24,304 INFO L130 PetriNetUnfolder]: For 2158/2231 co-relation queries the response was YES. [2021-10-21 19:42:24,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 429 events. 136/429 cut-off events. For 2158/2231 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2139 event pairs, 58 based on Foata normal form. 13/428 useless extension candidates. Maximal degree in co-relation 1723. Up to 194 conditions per place. [2021-10-21 19:42:24,310 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 16 selfloop transitions, 11 changer transitions 17/101 dead transitions. [2021-10-21 19:42:24,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 601 flow [2021-10-21 19:42:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:42:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 19:42:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 676 transitions. [2021-10-21 19:42:24,313 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7952941176470588 [2021-10-21 19:42:24,314 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 676 transitions. [2021-10-21 19:42:24,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 676 transitions. [2021-10-21 19:42:24,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:24,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 676 transitions. [2021-10-21 19:42:24,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 67.6) internal successors, (676), 10 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,319 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,319 INFO L186 Difference]: Start difference. First operand has 112 places, 83 transitions, 335 flow. Second operand 10 states and 676 transitions. [2021-10-21 19:42:24,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 601 flow [2021-10-21 19:42:24,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 101 transitions, 566 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-10-21 19:42:24,332 INFO L242 Difference]: Finished difference. Result has 118 places, 82 transitions, 337 flow [2021-10-21 19:42:24,333 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=337, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2021-10-21 19:42:24,333 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 30 predicate places. [2021-10-21 19:42:24,333 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 337 flow [2021-10-21 19:42:24,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,334 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:24,334 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] [2021-10-21 19:42:24,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:42:24,335 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash -191210822, now seen corresponding path program 2 times [2021-10-21 19:42:24,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:24,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147244992] [2021-10-21 19:42:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:24,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:24,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:24,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147244992] [2021-10-21 19:42:24,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147244992] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:24,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:24,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:42:24,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115943765] [2021-10-21 19:42:24,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:42:24,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:42:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:24,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-10-21 19:42:24,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 337 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:24,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-10-21 19:42:24,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:24,977 INFO L129 PetriNetUnfolder]: 102/358 cut-off events. [2021-10-21 19:42:24,978 INFO L130 PetriNetUnfolder]: For 1944/2070 co-relation queries the response was YES. [2021-10-21 19:42:24,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 358 events. 102/358 cut-off events. For 1944/2070 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1653 event pairs, 41 based on Foata normal form. 17/363 useless extension candidates. Maximal degree in co-relation 1438. Up to 149 conditions per place. [2021-10-21 19:42:24,983 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 18 selfloop transitions, 11 changer transitions 20/105 dead transitions. [2021-10-21 19:42:24,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 105 transitions, 689 flow [2021-10-21 19:42:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:42:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 19:42:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 866 transitions. [2021-10-21 19:42:24,988 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.783710407239819 [2021-10-21 19:42:24,988 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 866 transitions. [2021-10-21 19:42:24,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 866 transitions. [2021-10-21 19:42:24,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:24,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 866 transitions. [2021-10-21 19:42:24,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,995 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:24,995 INFO L186 Difference]: Start difference. First operand has 118 places, 82 transitions, 337 flow. Second operand 13 states and 866 transitions. [2021-10-21 19:42:24,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 105 transitions, 689 flow [2021-10-21 19:42:25,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 628 flow, removed 21 selfloop flow, removed 11 redundant places. [2021-10-21 19:42:25,004 INFO L242 Difference]: Finished difference. Result has 120 places, 83 transitions, 359 flow [2021-10-21 19:42:25,005 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=359, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2021-10-21 19:42:25,005 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-10-21 19:42:25,005 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 359 flow [2021-10-21 19:42:25,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,006 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:25,006 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] [2021-10-21 19:42:25,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:42:25,007 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:25,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1829531136, now seen corresponding path program 3 times [2021-10-21 19:42:25,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:25,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674349204] [2021-10-21 19:42:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:25,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:25,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:25,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674349204] [2021-10-21 19:42:25,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674349204] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:25,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:25,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:42:25,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375709665] [2021-10-21 19:42:25,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:42:25,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:42:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:25,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-10-21 19:42:25,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 359 flow. Second operand has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:25,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-10-21 19:42:25,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:25,519 INFO L129 PetriNetUnfolder]: 102/353 cut-off events. [2021-10-21 19:42:25,519 INFO L130 PetriNetUnfolder]: For 3632/3755 co-relation queries the response was YES. [2021-10-21 19:42:25,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 353 events. 102/353 cut-off events. For 3632/3755 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1612 event pairs, 42 based on Foata normal form. 17/358 useless extension candidates. Maximal degree in co-relation 1771. Up to 150 conditions per place. [2021-10-21 19:42:25,525 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 17 selfloop transitions, 13 changer transitions 11/98 dead transitions. [2021-10-21 19:42:25,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 98 transitions, 678 flow [2021-10-21 19:42:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:42:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 19:42:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2021-10-21 19:42:25,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2021-10-21 19:42:25,529 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 675 transitions. [2021-10-21 19:42:25,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 675 transitions. [2021-10-21 19:42:25,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:25,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 675 transitions. [2021-10-21 19:42:25,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 67.5) internal successors, (675), 10 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,535 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,535 INFO L186 Difference]: Start difference. First operand has 120 places, 83 transitions, 359 flow. Second operand 10 states and 675 transitions. [2021-10-21 19:42:25,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 98 transitions, 678 flow [2021-10-21 19:42:25,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 98 transitions, 599 flow, removed 29 selfloop flow, removed 11 redundant places. [2021-10-21 19:42:25,545 INFO L242 Difference]: Finished difference. Result has 116 places, 86 transitions, 402 flow [2021-10-21 19:42:25,545 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=116, PETRI_TRANSITIONS=86} [2021-10-21 19:42:25,546 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-10-21 19:42:25,546 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 86 transitions, 402 flow [2021-10-21 19:42:25,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,546 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:25,547 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] [2021-10-21 19:42:25,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:42:25,547 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1961170440, now seen corresponding path program 4 times [2021-10-21 19:42:25,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:25,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875498752] [2021-10-21 19:42:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:25,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:25,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:25,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875498752] [2021-10-21 19:42:25,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875498752] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:25,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:25,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:42:25,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94317523] [2021-10-21 19:42:25,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:42:25,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:42:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:42:25,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-10-21 19:42:25,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 86 transitions, 402 flow. Second operand has 10 states, 10 states have (on average 66.3) internal successors, (663), 10 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:25,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:25,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-10-21 19:42:25,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:26,392 INFO L129 PetriNetUnfolder]: 100/386 cut-off events. [2021-10-21 19:42:26,392 INFO L130 PetriNetUnfolder]: For 3498/3665 co-relation queries the response was YES. [2021-10-21 19:42:26,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 386 events. 100/386 cut-off events. For 3498/3665 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1991 event pairs, 24 based on Foata normal form. 26/397 useless extension candidates. Maximal degree in co-relation 1812. Up to 118 conditions per place. [2021-10-21 19:42:26,397 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 19 selfloop transitions, 14 changer transitions 23/114 dead transitions. [2021-10-21 19:42:26,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 894 flow [2021-10-21 19:42:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:42:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-21 19:42:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 958 transitions. [2021-10-21 19:42:26,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8050420168067227 [2021-10-21 19:42:26,402 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 958 transitions. [2021-10-21 19:42:26,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 958 transitions. [2021-10-21 19:42:26,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:26,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 958 transitions. [2021-10-21 19:42:26,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 68.42857142857143) internal successors, (958), 14 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:26,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 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-10-21 19:42:26,410 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 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-10-21 19:42:26,410 INFO L186 Difference]: Start difference. First operand has 116 places, 86 transitions, 402 flow. Second operand 14 states and 958 transitions. [2021-10-21 19:42:26,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 894 flow [2021-10-21 19:42:26,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 773 flow, removed 59 selfloop flow, removed 8 redundant places. [2021-10-21 19:42:26,421 INFO L242 Difference]: Finished difference. Result has 125 places, 85 transitions, 430 flow [2021-10-21 19:42:26,422 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2021-10-21 19:42:26,422 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2021-10-21 19:42:26,422 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 430 flow [2021-10-21 19:42:26,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.3) internal successors, (663), 10 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:26,423 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:26,423 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] [2021-10-21 19:42:26,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:42:26,423 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash 729552812, now seen corresponding path program 1 times [2021-10-21 19:42:26,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:26,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448093681] [2021-10-21 19:42:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:26,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:26,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:26,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448093681] [2021-10-21 19:42:26,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448093681] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:26,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:26,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:42:26,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569796380] [2021-10-21 19:42:26,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:42:26,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:42:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:42:26,754 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 85 [2021-10-21 19:42:26,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 430 flow. Second operand has 15 states, 15 states have (on average 59.266666666666666) internal successors, (889), 15 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:26,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:26,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 85 [2021-10-21 19:42:26,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:27,583 INFO L129 PetriNetUnfolder]: 262/802 cut-off events. [2021-10-21 19:42:27,583 INFO L130 PetriNetUnfolder]: For 6570/6590 co-relation queries the response was YES. [2021-10-21 19:42:27,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 802 events. 262/802 cut-off events. For 6570/6590 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5254 event pairs, 21 based on Foata normal form. 17/815 useless extension candidates. Maximal degree in co-relation 3154. Up to 254 conditions per place. [2021-10-21 19:42:27,594 INFO L132 encePairwiseOnDemand]: 70/85 looper letters, 35 selfloop transitions, 11 changer transitions 54/151 dead transitions. [2021-10-21 19:42:27,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 151 transitions, 1292 flow [2021-10-21 19:42:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-21 19:42:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-21 19:42:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1604 transitions. [2021-10-21 19:42:27,598 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7257918552036199 [2021-10-21 19:42:27,598 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1604 transitions. [2021-10-21 19:42:27,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1604 transitions. [2021-10-21 19:42:27,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:27,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1604 transitions. [2021-10-21 19:42:27,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 61.69230769230769) internal successors, (1604), 26 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:27,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 85.0) internal successors, (2295), 27 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:27,617 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 85.0) internal successors, (2295), 27 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:27,617 INFO L186 Difference]: Start difference. First operand has 125 places, 85 transitions, 430 flow. Second operand 26 states and 1604 transitions. [2021-10-21 19:42:27,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 151 transitions, 1292 flow [2021-10-21 19:42:27,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 1033 flow, removed 121 selfloop flow, removed 13 redundant places. [2021-10-21 19:42:27,633 INFO L242 Difference]: Finished difference. Result has 150 places, 83 transitions, 453 flow [2021-10-21 19:42:27,634 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=453, PETRI_PLACES=150, PETRI_TRANSITIONS=83} [2021-10-21 19:42:27,634 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 62 predicate places. [2021-10-21 19:42:27,634 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 83 transitions, 453 flow [2021-10-21 19:42:27,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 59.266666666666666) internal successors, (889), 15 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:27,635 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:27,635 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] [2021-10-21 19:42:27,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:42:27,635 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash -673174030, now seen corresponding path program 2 times [2021-10-21 19:42:27,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:27,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259783534] [2021-10-21 19:42:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:27,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:27,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:27,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259783534] [2021-10-21 19:42:27,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259783534] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:27,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:27,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:42:27,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432158258] [2021-10-21 19:42:27,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:42:27,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:27,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:42:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:42:27,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-10-21 19:42:27,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 83 transitions, 453 flow. Second operand has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:27,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:27,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-10-21 19:42:27,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:28,451 INFO L129 PetriNetUnfolder]: 77/325 cut-off events. [2021-10-21 19:42:28,451 INFO L130 PetriNetUnfolder]: For 5126/5269 co-relation queries the response was YES. [2021-10-21 19:42:28,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 325 events. 77/325 cut-off events. For 5126/5269 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1575 event pairs, 37 based on Foata normal form. 40/352 useless extension candidates. Maximal degree in co-relation 1722. Up to 120 conditions per place. [2021-10-21 19:42:28,458 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 17 selfloop transitions, 5 changer transitions 15/95 dead transitions. [2021-10-21 19:42:28,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 95 transitions, 779 flow [2021-10-21 19:42:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:42:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-21 19:42:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 917 transitions. [2021-10-21 19:42:28,461 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7705882352941177 [2021-10-21 19:42:28,461 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 917 transitions. [2021-10-21 19:42:28,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 917 transitions. [2021-10-21 19:42:28,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:28,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 917 transitions. [2021-10-21 19:42:28,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 65.5) internal successors, (917), 14 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:28,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 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-10-21 19:42:28,467 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 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-10-21 19:42:28,468 INFO L186 Difference]: Start difference. First operand has 150 places, 83 transitions, 453 flow. Second operand 14 states and 917 transitions. [2021-10-21 19:42:28,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 95 transitions, 779 flow [2021-10-21 19:42:28,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 95 transitions, 621 flow, removed 71 selfloop flow, removed 18 redundant places. [2021-10-21 19:42:28,483 INFO L242 Difference]: Finished difference. Result has 132 places, 79 transitions, 387 flow [2021-10-21 19:42:28,484 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=387, PETRI_PLACES=132, PETRI_TRANSITIONS=79} [2021-10-21 19:42:28,484 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 44 predicate places. [2021-10-21 19:42:28,484 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 79 transitions, 387 flow [2021-10-21 19:42:28,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:28,485 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:28,485 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] [2021-10-21 19:42:28,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:42:28,485 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1228993504, now seen corresponding path program 3 times [2021-10-21 19:42:28,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:28,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199961629] [2021-10-21 19:42:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:28,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:28,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:28,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199961629] [2021-10-21 19:42:28,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199961629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:28,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:28,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:42:28,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001475140] [2021-10-21 19:42:28,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:42:28,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:42:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:42:28,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-10-21 19:42:28,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 79 transitions, 387 flow. Second operand has 11 states, 11 states have (on average 64.45454545454545) internal successors, (709), 11 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:28,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:28,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-10-21 19:42:28,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:29,109 INFO L129 PetriNetUnfolder]: 80/384 cut-off events. [2021-10-21 19:42:29,109 INFO L130 PetriNetUnfolder]: For 3504/3618 co-relation queries the response was YES. [2021-10-21 19:42:29,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 384 events. 80/384 cut-off events. For 3504/3618 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2155 event pairs, 16 based on Foata normal form. 29/403 useless extension candidates. Maximal degree in co-relation 1634. Up to 87 conditions per place. [2021-10-21 19:42:29,115 INFO L132 encePairwiseOnDemand]: 75/85 looper letters, 19 selfloop transitions, 8 changer transitions 10/95 dead transitions. [2021-10-21 19:42:29,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 95 transitions, 689 flow [2021-10-21 19:42:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:42:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 19:42:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 856 transitions. [2021-10-21 19:42:29,117 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7746606334841629 [2021-10-21 19:42:29,117 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 856 transitions. [2021-10-21 19:42:29,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 856 transitions. [2021-10-21 19:42:29,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:29,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 856 transitions. [2021-10-21 19:42:29,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.84615384615384) internal successors, (856), 13 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,123 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,123 INFO L186 Difference]: Start difference. First operand has 132 places, 79 transitions, 387 flow. Second operand 13 states and 856 transitions. [2021-10-21 19:42:29,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 95 transitions, 689 flow [2021-10-21 19:42:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 562 flow, removed 55 selfloop flow, removed 18 redundant places. [2021-10-21 19:42:29,136 INFO L242 Difference]: Finished difference. Result has 122 places, 79 transitions, 362 flow [2021-10-21 19:42:29,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=362, PETRI_PLACES=122, PETRI_TRANSITIONS=79} [2021-10-21 19:42:29,137 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2021-10-21 19:42:29,137 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 79 transitions, 362 flow [2021-10-21 19:42:29,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.45454545454545) internal successors, (709), 11 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:29,137 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] [2021-10-21 19:42:29,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:42:29,138 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash -813929410, now seen corresponding path program 1 times [2021-10-21 19:42:29,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:29,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136396332] [2021-10-21 19:42:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:29,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:29,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:29,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136396332] [2021-10-21 19:42:29,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136396332] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:29,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:29,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:42:29,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373090412] [2021-10-21 19:42:29,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:42:29,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:42:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:42:29,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-21 19:42:29,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 79 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:29,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-21 19:42:29,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:29,402 INFO L129 PetriNetUnfolder]: 157/586 cut-off events. [2021-10-21 19:42:29,402 INFO L130 PetriNetUnfolder]: For 3929/3987 co-relation queries the response was YES. [2021-10-21 19:42:29,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 586 events. 157/586 cut-off events. For 3929/3987 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4129 event pairs, 10 based on Foata normal form. 35/575 useless extension candidates. Maximal degree in co-relation 1983. Up to 173 conditions per place. [2021-10-21 19:42:29,409 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 12 changer transitions 10/100 dead transitions. [2021-10-21 19:42:29,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 574 flow [2021-10-21 19:42:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:42:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 19:42:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-10-21 19:42:29,411 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-10-21 19:42:29,411 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-10-21 19:42:29,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-10-21 19:42:29,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:29,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-10-21 19:42:29,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,415 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,415 INFO L186 Difference]: Start difference. First operand has 122 places, 79 transitions, 362 flow. Second operand 10 states and 755 transitions. [2021-10-21 19:42:29,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 574 flow [2021-10-21 19:42:29,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 100 transitions, 516 flow, removed 22 selfloop flow, removed 16 redundant places. [2021-10-21 19:42:29,425 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 369 flow [2021-10-21 19:42:29,426 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2021-10-21 19:42:29,426 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 25 predicate places. [2021-10-21 19:42:29,426 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 369 flow [2021-10-21 19:42:29,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:29,427 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] [2021-10-21 19:42:29,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:42:29,427 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash 907903445, now seen corresponding path program 1 times [2021-10-21 19:42:29,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:29,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233556066] [2021-10-21 19:42:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:29,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:29,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:29,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233556066] [2021-10-21 19:42:29,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233556066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:29,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:29,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:42:29,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366925599] [2021-10-21 19:42:29,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:42:29,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:29,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:42:29,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:42:29,545 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-21 19:42:29,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:42:29,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-21 19:42:29,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:42:29,714 INFO L129 PetriNetUnfolder]: 51/261 cut-off events. [2021-10-21 19:42:29,714 INFO L130 PetriNetUnfolder]: For 1251/1329 co-relation queries the response was YES. [2021-10-21 19:42:29,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 261 events. 51/261 cut-off events. For 1251/1329 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1374 event pairs, 0 based on Foata normal form. 39/291 useless extension candidates. Maximal degree in co-relation 811. Up to 68 conditions per place. [2021-10-21 19:42:29,717 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 11 selfloop transitions, 15 changer transitions 14/103 dead transitions. [2021-10-21 19:42:29,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 103 transitions, 553 flow [2021-10-21 19:42:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:42:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 19:42:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 970 transitions. [2021-10-21 19:42:29,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8778280542986425 [2021-10-21 19:42:29,720 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 970 transitions. [2021-10-21 19:42:29,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 970 transitions. [2021-10-21 19:42:29,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:29,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 970 transitions. [2021-10-21 19:42:29,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.61538461538461) internal successors, (970), 13 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,726 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,726 INFO L186 Difference]: Start difference. First operand has 113 places, 85 transitions, 369 flow. Second operand 13 states and 970 transitions. [2021-10-21 19:42:29,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 103 transitions, 553 flow [2021-10-21 19:42:29,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 103 transitions, 435 flow, removed 50 selfloop flow, removed 12 redundant places. [2021-10-21 19:42:29,734 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 354 flow [2021-10-21 19:42:29,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=354, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2021-10-21 19:42:29,735 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-10-21 19:42:29,735 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 354 flow [2021-10-21 19:42:29,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:29,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:42:29,736 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] [2021-10-21 19:42:29,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:42:29,737 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-21 19:42:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:29,737 INFO L82 PathProgramCache]: Analyzing trace with hash 587720075, now seen corresponding path program 1 times [2021-10-21 19:42:29,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:29,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312448912] [2021-10-21 19:42:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:29,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:29,785 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:29,900 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:29,903 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:42:29,904 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:29,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:29,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-21 19:42:29,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-21 19:42:29,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:42:29,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:42:29,916 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-21 19:42:29,916 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:42:30,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:42:30 BasicIcfg [2021-10-21 19:42:30,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:42:30,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:42:30,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:42:30,075 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:42:30,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:19" (3/4) ... [2021-10-21 19:42:30,078 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:42:30,224 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:42:30,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:42:30,226 INFO L168 Benchmark]: Toolchain (without parser) took 12848.57 ms. Allocated memory was 79.7 MB in the beginning and 237.0 MB in the end (delta: 157.3 MB). Free memory was 41.5 MB in the beginning and 126.9 MB in the end (delta: -85.3 MB). Peak memory consumption was 73.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,226 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 79.7 MB. Free memory is still 43.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:42:30,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.24 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 41.3 MB in the beginning and 62.7 MB in the end (delta: -21.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.34 ms. Allocated memory is still 96.5 MB. Free memory was 62.7 MB in the beginning and 60.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,228 INFO L168 Benchmark]: Boogie Preprocessor took 53.36 ms. Allocated memory is still 96.5 MB. Free memory was 60.0 MB in the beginning and 57.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,228 INFO L168 Benchmark]: RCFGBuilder took 1806.28 ms. Allocated memory is still 96.5 MB. Free memory was 57.9 MB in the beginning and 34.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,228 INFO L168 Benchmark]: TraceAbstraction took 10193.74 ms. Allocated memory was 136.3 MB in the beginning and 237.0 MB in the end (delta: 100.7 MB). Free memory was 105.3 MB in the beginning and 145.7 MB in the end (delta: -40.5 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,229 INFO L168 Benchmark]: Witness Printer took 149.70 ms. Allocated memory is still 237.0 MB. Free memory was 145.7 MB in the beginning and 126.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:30,232 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.25 ms. Allocated memory is still 79.7 MB. Free memory is still 43.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 563.24 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 41.3 MB in the beginning and 62.7 MB in the end (delta: -21.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.34 ms. Allocated memory is still 96.5 MB. Free memory was 62.7 MB in the beginning and 60.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.36 ms. Allocated memory is still 96.5 MB. Free memory was 60.0 MB in the beginning and 57.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1806.28 ms. Allocated memory is still 96.5 MB. Free memory was 57.9 MB in the beginning and 34.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10193.74 ms. Allocated memory was 136.3 MB in the beginning and 237.0 MB in the end (delta: 100.7 MB). Free memory was 105.3 MB in the beginning and 145.7 MB in the end (delta: -40.5 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.1 GB. * Witness Printer took 149.70 ms. Allocated memory is still 237.0 MB. Free memory was 145.7 MB in the beginning and 126.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9916.6ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5762.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 59.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 166 SDtfs, 511 SDslu, 658 SDs, 0 SdLazy, 1308 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1640.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2634.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=11, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 80.9ms SsaConstructionTime, 722.6ms SatisfiabilityAnalysisTime, 2839.9ms InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 5525 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-10-21 19:42:30,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8682c729-0d7a-42b9-ae2d-8c4aa5f9d7b5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...