./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/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_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/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_7ab8384c-1e65-4ed6-9436-163527b38e49/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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:11:14,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:11:14,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:11:14,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:11:14,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:11:14,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:11:14,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:11:14,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:11:14,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:11:14,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:11:14,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:11:14,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:11:14,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:11:14,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:11:14,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:11:14,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:11:14,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:11:14,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:11:14,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:11:14,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:11:14,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:11:14,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:11:14,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:11:14,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:11:14,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:11:14,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:11:14,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:11:14,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:11:14,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:11:14,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:11:14,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:11:14,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:11:14,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:11:15,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:11:15,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:11:15,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:11:15,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:11:15,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:11:15,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:11:15,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:11:15,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:11:15,009 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:11:15,058 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:11:15,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:11:15,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:11:15,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:11:15,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:11:15,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:11:15,063 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:11:15,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:11:15,064 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:11:15,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:11:15,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:11:15,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:11:15,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:11:15,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:11:15,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:11:15,067 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:11:15,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:11:15,068 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:11:15,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:11:15,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:11:15,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:11:15,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:11:15,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:11:15,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:11:15,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:11:15,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:11:15,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:11:15,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:11:15,071 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:11:15,073 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:11:15,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:11:15,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:11:15,074 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_7ab8384c-1e65-4ed6-9436-163527b38e49/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_7ab8384c-1e65-4ed6-9436-163527b38e49/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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2021-10-21 20:11:15,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:11:15,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:11:15,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:11:15,407 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:11:15,408 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:11:15,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-10-21 20:11:15,514 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/data/3724117f3/a12840f7881349e38d57dbb236071a29/FLAG77a6ecb52 [2021-10-21 20:11:16,251 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:11:16,252 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-10-21 20:11:16,285 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/data/3724117f3/a12840f7881349e38d57dbb236071a29/FLAG77a6ecb52 [2021-10-21 20:11:16,506 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/data/3724117f3/a12840f7881349e38d57dbb236071a29 [2021-10-21 20:11:16,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:11:16,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:11:16,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:11:16,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:11:16,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:11:16,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:11:16" (1/1) ... [2021-10-21 20:11:16,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25481f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:16, skipping insertion in model container [2021-10-21 20:11:16,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:11:16" (1/1) ... [2021-10-21 20:11:16,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:11:16,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:11:16,812 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_7ab8384c-1e65-4ed6-9436-163527b38e49/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-10-21 20:11:17,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:11:17,178 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:11:17,194 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_7ab8384c-1e65-4ed6-9436-163527b38e49/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-10-21 20:11:17,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:11:17,384 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:11:17,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17 WrapperNode [2021-10-21 20:11:17,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:11:17,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:11:17,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:11:17,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:11:17,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:11:17,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:11:17,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:11:17,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:11:17,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:11:17,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:11:17,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:11:17,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:11:17,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (1/1) ... [2021-10-21 20:11:17,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:11:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:11:17,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:11:17,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:11:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 20:11:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-21 20:11:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:11:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 20:11:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-21 20:11:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-21 20:11:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-21 20:11:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-21 20:11:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-21 20:11:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-21 20:11:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:11:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-21 20:11:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:11:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:11:17,720 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 20:11:20,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:11:20,164 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-21 20:11:20,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:11:20 BoogieIcfgContainer [2021-10-21 20:11:20,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:11:20,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:11:20,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:11:20,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:11:20,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:11:16" (1/3) ... [2021-10-21 20:11:20,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ed5b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:11:20, skipping insertion in model container [2021-10-21 20:11:20,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:17" (2/3) ... [2021-10-21 20:11:20,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ed5b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:11:20, skipping insertion in model container [2021-10-21 20:11:20,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:11:20" (3/3) ... [2021-10-21 20:11:20,183 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-10-21 20:11:20,190 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-21 20:11:20,190 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:11:20,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 20:11:20,191 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-21 20:11:20,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,241 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,241 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,242 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,242 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,243 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,243 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,244 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,245 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,265 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,266 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,266 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,267 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,285 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,298 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,304 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 20:11:20,307 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-21 20:11:20,381 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:11:20,393 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 20:11:20,393 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-21 20:11:20,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-10-21 20:11:20,499 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-10-21 20:11:20,499 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:11:20,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-21 20:11:20,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-10-21 20:11:20,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-10-21 20:11:20,532 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-10-21 20:11:20,533 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:11:20,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:20,534 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] [2021-10-21 20:11:20,535 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1847846630, now seen corresponding path program 1 times [2021-10-21 20:11:20,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:20,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482094908] [2021-10-21 20:11:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:20,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:21,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 20:11:21,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:21,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482094908] [2021-10-21 20:11:21,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482094908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:21,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:21,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:11:21,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227387311] [2021-10-21 20:11:21,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:21,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:21,047 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 105 [2021-10-21 20:11:21,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 20:11:21,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:21,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 105 [2021-10-21 20:11:21,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:21,327 INFO L129 PetriNetUnfolder]: 49/392 cut-off events. [2021-10-21 20:11:21,327 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:11:21,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 392 events. 49/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1982 event pairs, 38 based on Foata normal form. 18/386 useless extension candidates. Maximal degree in co-relation 442. Up to 65 conditions per place. [2021-10-21 20:11:21,338 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 9 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2021-10-21 20:11:21,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 235 flow [2021-10-21 20:11:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-21 20:11:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2021-10-21 20:11:21,360 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.946031746031746 [2021-10-21 20:11:21,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2021-10-21 20:11:21,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2021-10-21 20:11:21,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:21,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2021-10-21 20:11:21,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 20:11:21,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 20:11:21,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 20:11:21,389 INFO L186 Difference]: Start difference. First operand has 110 places, 102 transitions, 213 flow. Second operand 3 states and 298 transitions. [2021-10-21 20:11:21,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 235 flow [2021-10-21 20:11:21,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-21 20:11:21,401 INFO L242 Difference]: Finished difference. Result has 107 places, 98 transitions, 206 flow [2021-10-21 20:11:21,403 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2021-10-21 20:11:21,404 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, -3 predicate places. [2021-10-21 20:11:21,405 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 206 flow [2021-10-21 20:11:21,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 20:11:21,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:21,406 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:21,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:11:21,407 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash -459637492, now seen corresponding path program 1 times [2021-10-21 20:11:21,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:21,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440500804] [2021-10-21 20:11:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:21,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:21,879 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 20:11:21,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:21,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440500804] [2021-10-21 20:11:21,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440500804] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:21,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:21,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:11:21,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889591325] [2021-10-21 20:11:21,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:11:21,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:11:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:11:21,884 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-21 20:11:21,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:21,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:21,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-21 20:11:21,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:22,112 INFO L129 PetriNetUnfolder]: 30/251 cut-off events. [2021-10-21 20:11:22,113 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 20:11:22,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 251 events. 30/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 938 event pairs, 6 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 295. Up to 36 conditions per place. [2021-10-21 20:11:22,115 INFO L132 encePairwiseOnDemand]: 98/105 looper letters, 8 selfloop transitions, 3 changer transitions 31/121 dead transitions. [2021-10-21 20:11:22,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 318 flow [2021-10-21 20:11:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:11:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 20:11:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2021-10-21 20:11:22,122 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9132275132275133 [2021-10-21 20:11:22,122 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2021-10-21 20:11:22,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2021-10-21 20:11:22,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:22,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2021-10-21 20:11:22,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:22,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:22,133 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:22,133 INFO L186 Difference]: Start difference. First operand has 107 places, 98 transitions, 206 flow. Second operand 9 states and 863 transitions. [2021-10-21 20:11:22,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 318 flow [2021-10-21 20:11:22,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 121 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-21 20:11:22,139 INFO L242 Difference]: Finished difference. Result has 120 places, 90 transitions, 225 flow [2021-10-21 20:11:22,139 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=120, PETRI_TRANSITIONS=90} [2021-10-21 20:11:22,140 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2021-10-21 20:11:22,140 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 90 transitions, 225 flow [2021-10-21 20:11:22,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:22,141 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:22,141 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:22,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:11:22,142 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash 633044429, now seen corresponding path program 1 times [2021-10-21 20:11:22,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:22,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329084879] [2021-10-21 20:11:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:22,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:22,316 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 20:11:22,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:22,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329084879] [2021-10-21 20:11:22,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329084879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:22,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:22,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:11:22,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866962278] [2021-10-21 20:11:22,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:11:22,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:11:22,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:11:22,321 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-21 20:11:22,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 90 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:22,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:22,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-21 20:11:22,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:22,515 INFO L129 PetriNetUnfolder]: 58/257 cut-off events. [2021-10-21 20:11:22,515 INFO L130 PetriNetUnfolder]: For 213/225 co-relation queries the response was YES. [2021-10-21 20:11:22,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 257 events. 58/257 cut-off events. For 213/225 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 972 event pairs, 17 based on Foata normal form. 6/252 useless extension candidates. Maximal degree in co-relation 501. Up to 60 conditions per place. [2021-10-21 20:11:22,520 INFO L132 encePairwiseOnDemand]: 98/105 looper letters, 8 selfloop transitions, 3 changer transitions 19/111 dead transitions. [2021-10-21 20:11:22,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 345 flow [2021-10-21 20:11:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:11:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 20:11:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 860 transitions. [2021-10-21 20:11:22,524 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-10-21 20:11:22,524 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 860 transitions. [2021-10-21 20:11:22,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 860 transitions. [2021-10-21 20:11:22,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:22,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 860 transitions. [2021-10-21 20:11:22,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.55555555555556) internal successors, (860), 9 states have internal predecessors, (860), 0 states have call successors, (0), 0 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 20:11:22,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:22,534 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:22,534 INFO L186 Difference]: Start difference. First operand has 120 places, 90 transitions, 225 flow. Second operand 9 states and 860 transitions. [2021-10-21 20:11:22,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 345 flow [2021-10-21 20:11:22,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 328 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-10-21 20:11:22,542 INFO L242 Difference]: Finished difference. Result has 115 places, 92 transitions, 259 flow [2021-10-21 20:11:22,543 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=115, PETRI_TRANSITIONS=92} [2021-10-21 20:11:22,543 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2021-10-21 20:11:22,543 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 259 flow [2021-10-21 20:11:22,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:22,544 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:22,545 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:22,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:11:22,545 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash -672384026, now seen corresponding path program 1 times [2021-10-21 20:11:22,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:22,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753991808] [2021-10-21 20:11:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:22,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:22,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:22,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753991808] [2021-10-21 20:11:22,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753991808] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:22,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:22,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:11:22,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554697879] [2021-10-21 20:11:22,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:11:22,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:22,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:11:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:11:22,756 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-21 20:11:22,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 20:11:22,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:22,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-21 20:11:22,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:22,967 INFO L129 PetriNetUnfolder]: 34/278 cut-off events. [2021-10-21 20:11:22,968 INFO L130 PetriNetUnfolder]: For 439/506 co-relation queries the response was YES. [2021-10-21 20:11:22,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 278 events. 34/278 cut-off events. For 439/506 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1262 event pairs, 4 based on Foata normal form. 8/276 useless extension candidates. Maximal degree in co-relation 620. Up to 36 conditions per place. [2021-10-21 20:11:22,973 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 12 selfloop transitions, 3 changer transitions 10/106 dead transitions. [2021-10-21 20:11:22,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 106 transitions, 407 flow [2021-10-21 20:11:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:11:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 20:11:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-10-21 20:11:22,978 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9037037037037037 [2021-10-21 20:11:22,978 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-10-21 20:11:22,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-10-21 20:11:22,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:22,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-10-21 20:11:22,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 0 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 20:11:22,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:22,988 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:22,988 INFO L186 Difference]: Start difference. First operand has 115 places, 92 transitions, 259 flow. Second operand 9 states and 854 transitions. [2021-10-21 20:11:22,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 106 transitions, 407 flow [2021-10-21 20:11:22,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 106 transitions, 376 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-10-21 20:11:22,997 INFO L242 Difference]: Finished difference. Result has 120 places, 92 transitions, 271 flow [2021-10-21 20:11:22,997 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=120, PETRI_TRANSITIONS=92} [2021-10-21 20:11:22,998 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2021-10-21 20:11:22,998 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 92 transitions, 271 flow [2021-10-21 20:11:22,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 20:11:22,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:22,999 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:22,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:11:23,000 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 44194158, now seen corresponding path program 1 times [2021-10-21 20:11:23,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:23,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15031199] [2021-10-21 20:11:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:23,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:23,308 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 20:11:23,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:23,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15031199] [2021-10-21 20:11:23,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15031199] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:23,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:23,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:11:23,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73250418] [2021-10-21 20:11:23,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:11:23,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:11:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:11:23,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2021-10-21 20:11:23,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 92 transitions, 271 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 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 20:11:23,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:23,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2021-10-21 20:11:23,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:24,244 INFO L129 PetriNetUnfolder]: 925/1986 cut-off events. [2021-10-21 20:11:24,244 INFO L130 PetriNetUnfolder]: For 4512/4572 co-relation queries the response was YES. [2021-10-21 20:11:24,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 1986 events. 925/1986 cut-off events. For 4512/4572 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 13699 event pairs, 333 based on Foata normal form. 66/1978 useless extension candidates. Maximal degree in co-relation 5396. Up to 789 conditions per place. [2021-10-21 20:11:24,276 INFO L132 encePairwiseOnDemand]: 93/105 looper letters, 14 selfloop transitions, 10 changer transitions 44/144 dead transitions. [2021-10-21 20:11:24,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 571 flow [2021-10-21 20:11:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 20:11:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-21 20:11:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1331 transitions. [2021-10-21 20:11:24,283 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8450793650793651 [2021-10-21 20:11:24,283 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1331 transitions. [2021-10-21 20:11:24,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1331 transitions. [2021-10-21 20:11:24,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:24,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1331 transitions. [2021-10-21 20:11:24,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.73333333333333) internal successors, (1331), 15 states have internal predecessors, (1331), 0 states have call successors, (0), 0 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 20:11:24,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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 20:11:24,297 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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 20:11:24,298 INFO L186 Difference]: Start difference. First operand has 120 places, 92 transitions, 271 flow. Second operand 15 states and 1331 transitions. [2021-10-21 20:11:24,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 571 flow [2021-10-21 20:11:24,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 144 transitions, 526 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-10-21 20:11:24,328 INFO L242 Difference]: Finished difference. Result has 132 places, 98 transitions, 334 flow [2021-10-21 20:11:24,329 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=334, PETRI_PLACES=132, PETRI_TRANSITIONS=98} [2021-10-21 20:11:24,329 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 22 predicate places. [2021-10-21 20:11:24,329 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 334 flow [2021-10-21 20:11:24,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 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 20:11:24,330 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:24,331 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:24,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 20:11:24,331 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2113384258, now seen corresponding path program 1 times [2021-10-21 20:11:24,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:24,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591459970] [2021-10-21 20:11:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:24,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:24,631 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 20:11:24,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:24,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591459970] [2021-10-21 20:11:24,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591459970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:24,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:24,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:11:24,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375890890] [2021-10-21 20:11:24,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:11:24,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:11:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:11:24,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 105 [2021-10-21 20:11:24,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 98 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 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 20:11:24,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:24,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 105 [2021-10-21 20:11:24,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:25,571 INFO L129 PetriNetUnfolder]: 715/1664 cut-off events. [2021-10-21 20:11:25,572 INFO L130 PetriNetUnfolder]: For 6512/6592 co-relation queries the response was YES. [2021-10-21 20:11:25,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 1664 events. 715/1664 cut-off events. For 6512/6592 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11244 event pairs, 270 based on Foata normal form. 52/1663 useless extension candidates. Maximal degree in co-relation 5847. Up to 645 conditions per place. [2021-10-21 20:11:25,602 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 29 selfloop transitions, 9 changer transitions 37/152 dead transitions. [2021-10-21 20:11:25,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 836 flow [2021-10-21 20:11:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 20:11:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-21 20:11:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1262 transitions. [2021-10-21 20:11:25,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8585034013605443 [2021-10-21 20:11:25,609 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1262 transitions. [2021-10-21 20:11:25,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1262 transitions. [2021-10-21 20:11:25,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:25,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1262 transitions. [2021-10-21 20:11:25,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.14285714285714) internal successors, (1262), 14 states have internal predecessors, (1262), 0 states have call successors, (0), 0 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 20:11:25,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 20:11:25,621 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 0 states have call successors, (0), 0 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 20:11:25,621 INFO L186 Difference]: Start difference. First operand has 132 places, 98 transitions, 334 flow. Second operand 14 states and 1262 transitions. [2021-10-21 20:11:25,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 836 flow [2021-10-21 20:11:25,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 152 transitions, 802 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-10-21 20:11:25,644 INFO L242 Difference]: Finished difference. Result has 142 places, 102 transitions, 412 flow [2021-10-21 20:11:25,644 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=412, PETRI_PLACES=142, PETRI_TRANSITIONS=102} [2021-10-21 20:11:25,644 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 32 predicate places. [2021-10-21 20:11:25,645 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 102 transitions, 412 flow [2021-10-21 20:11:25,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 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 20:11:25,645 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:25,646 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:25,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:11:25,646 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash -955308008, now seen corresponding path program 1 times [2021-10-21 20:11:25,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:25,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096253590] [2021-10-21 20:11:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:25,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:25,876 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 20:11:25,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:25,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096253590] [2021-10-21 20:11:25,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096253590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:25,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:25,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:11:25,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825539666] [2021-10-21 20:11:25,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:11:25,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:11:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:11:25,885 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-21 20:11:25,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 102 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 20:11:25,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:25,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-21 20:11:25,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:26,508 INFO L129 PetriNetUnfolder]: 538/1637 cut-off events. [2021-10-21 20:11:26,509 INFO L130 PetriNetUnfolder]: For 13631/14255 co-relation queries the response was YES. [2021-10-21 20:11:26,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7356 conditions, 1637 events. 538/1637 cut-off events. For 13631/14255 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13450 event pairs, 257 based on Foata normal form. 52/1579 useless extension candidates. Maximal degree in co-relation 7275. Up to 438 conditions per place. [2021-10-21 20:11:26,547 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 12 selfloop transitions, 3 changer transitions 10/116 dead transitions. [2021-10-21 20:11:26,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 116 transitions, 624 flow [2021-10-21 20:11:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:11:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 20:11:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-10-21 20:11:26,552 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9037037037037037 [2021-10-21 20:11:26,553 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-10-21 20:11:26,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-10-21 20:11:26,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:26,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-10-21 20:11:26,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 0 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 20:11:26,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:26,562 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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 20:11:26,562 INFO L186 Difference]: Start difference. First operand has 142 places, 102 transitions, 412 flow. Second operand 9 states and 854 transitions. [2021-10-21 20:11:26,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 116 transitions, 624 flow [2021-10-21 20:11:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 116 transitions, 566 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-10-21 20:11:26,605 INFO L242 Difference]: Finished difference. Result has 140 places, 102 transitions, 411 flow [2021-10-21 20:11:26,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=411, PETRI_PLACES=140, PETRI_TRANSITIONS=102} [2021-10-21 20:11:26,606 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 30 predicate places. [2021-10-21 20:11:26,606 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 102 transitions, 411 flow [2021-10-21 20:11:26,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 20:11:26,607 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:26,607 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:26,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:11:26,608 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1576691181, now seen corresponding path program 1 times [2021-10-21 20:11:26,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:26,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753703110] [2021-10-21 20:11:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:26,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:26,988 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 20:11:26,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:26,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753703110] [2021-10-21 20:11:26,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753703110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:26,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:26,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 20:11:26,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912919454] [2021-10-21 20:11:26,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 20:11:26,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 20:11:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 20:11:26,994 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-10-21 20:11:26,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 102 transitions, 411 flow. Second operand has 12 states, 12 states have (on average 84.08333333333333) internal successors, (1009), 12 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 20:11:26,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:26,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-10-21 20:11:26,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:27,860 INFO L129 PetriNetUnfolder]: 677/1597 cut-off events. [2021-10-21 20:11:27,861 INFO L130 PetriNetUnfolder]: For 11938/12224 co-relation queries the response was YES. [2021-10-21 20:11:27,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7654 conditions, 1597 events. 677/1597 cut-off events. For 11938/12224 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10715 event pairs, 348 based on Foata normal form. 52/1579 useless extension candidates. Maximal degree in co-relation 7569. Up to 959 conditions per place. [2021-10-21 20:11:27,901 INFO L132 encePairwiseOnDemand]: 91/105 looper letters, 20 selfloop transitions, 15 changer transitions 41/151 dead transitions. [2021-10-21 20:11:27,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 151 transitions, 1014 flow [2021-10-21 20:11:27,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-21 20:11:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-21 20:11:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1391 transitions. [2021-10-21 20:11:27,908 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8279761904761904 [2021-10-21 20:11:27,908 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1391 transitions. [2021-10-21 20:11:27,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1391 transitions. [2021-10-21 20:11:27,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:27,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1391 transitions. [2021-10-21 20:11:27,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.9375) internal successors, (1391), 16 states have internal predecessors, (1391), 0 states have call successors, (0), 0 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 20:11:27,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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 20:11:27,923 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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 20:11:27,924 INFO L186 Difference]: Start difference. First operand has 140 places, 102 transitions, 411 flow. Second operand 16 states and 1391 transitions. [2021-10-21 20:11:27,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 151 transitions, 1014 flow [2021-10-21 20:11:27,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 151 transitions, 961 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-10-21 20:11:27,952 INFO L242 Difference]: Finished difference. Result has 153 places, 109 transitions, 538 flow [2021-10-21 20:11:27,953 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=538, PETRI_PLACES=153, PETRI_TRANSITIONS=109} [2021-10-21 20:11:27,953 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 43 predicate places. [2021-10-21 20:11:27,953 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 109 transitions, 538 flow [2021-10-21 20:11:27,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.08333333333333) internal successors, (1009), 12 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 20:11:27,954 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:27,954 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:27,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:11:27,955 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:27,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1745901103, now seen corresponding path program 1 times [2021-10-21 20:11:27,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:27,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663437274] [2021-10-21 20:11:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:27,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:28,378 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 20:11:28,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:28,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663437274] [2021-10-21 20:11:28,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663437274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:28,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:28,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 20:11:28,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108332792] [2021-10-21 20:11:28,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 20:11:28,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:28,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 20:11:28,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-21 20:11:28,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2021-10-21 20:11:28,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 109 transitions, 538 flow. Second operand has 12 states, 12 states have (on average 85.16666666666667) internal successors, (1022), 12 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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 20:11:28,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:28,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2021-10-21 20:11:28,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:29,621 INFO L129 PetriNetUnfolder]: 787/2385 cut-off events. [2021-10-21 20:11:29,622 INFO L130 PetriNetUnfolder]: For 24424/25072 co-relation queries the response was YES. [2021-10-21 20:11:29,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11723 conditions, 2385 events. 787/2385 cut-off events. For 24424/25072 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21174 event pairs, 135 based on Foata normal form. 95/2403 useless extension candidates. Maximal degree in co-relation 11627. Up to 599 conditions per place. [2021-10-21 20:11:29,666 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 30 selfloop transitions, 11 changer transitions 33/149 dead transitions. [2021-10-21 20:11:29,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 149 transitions, 1262 flow [2021-10-21 20:11:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 20:11:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 20:11:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1151 transitions. [2021-10-21 20:11:29,671 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8432234432234432 [2021-10-21 20:11:29,671 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1151 transitions. [2021-10-21 20:11:29,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1151 transitions. [2021-10-21 20:11:29,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:29,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1151 transitions. [2021-10-21 20:11:29,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 0 states have call successors, (0), 0 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 20:11:29,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 20:11:29,684 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 20:11:29,684 INFO L186 Difference]: Start difference. First operand has 153 places, 109 transitions, 538 flow. Second operand 13 states and 1151 transitions. [2021-10-21 20:11:29,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 149 transitions, 1262 flow [2021-10-21 20:11:29,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 1075 flow, removed 86 selfloop flow, removed 13 redundant places. [2021-10-21 20:11:29,762 INFO L242 Difference]: Finished difference. Result has 150 places, 109 transitions, 544 flow [2021-10-21 20:11:29,763 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=544, PETRI_PLACES=150, PETRI_TRANSITIONS=109} [2021-10-21 20:11:29,763 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 40 predicate places. [2021-10-21 20:11:29,764 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 109 transitions, 544 flow [2021-10-21 20:11:29,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.16666666666667) internal successors, (1022), 12 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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 20:11:29,765 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:29,765 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:29,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:11:29,766 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:29,766 INFO L82 PathProgramCache]: Analyzing trace with hash -151558173, now seen corresponding path program 1 times [2021-10-21 20:11:29,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:29,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199626316] [2021-10-21 20:11:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:29,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:30,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:30,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199626316] [2021-10-21 20:11:30,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199626316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:30,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:30,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 20:11:30,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414313] [2021-10-21 20:11:30,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 20:11:30,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 20:11:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-21 20:11:30,163 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-10-21 20:11:30,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 109 transitions, 544 flow. Second operand has 11 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 0 states have call successors, (0), 0 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 20:11:30,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:30,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-10-21 20:11:30,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:31,120 INFO L129 PetriNetUnfolder]: 475/1476 cut-off events. [2021-10-21 20:11:31,121 INFO L130 PetriNetUnfolder]: For 14314/14968 co-relation queries the response was YES. [2021-10-21 20:11:31,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 1476 events. 475/1476 cut-off events. For 14314/14968 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11609 event pairs, 121 based on Foata normal form. 68/1489 useless extension candidates. Maximal degree in co-relation 7419. Up to 614 conditions per place. [2021-10-21 20:11:31,160 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 28 selfloop transitions, 17 changer transitions 32/152 dead transitions. [2021-10-21 20:11:31,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 152 transitions, 1247 flow [2021-10-21 20:11:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 20:11:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-21 20:11:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1562 transitions. [2021-10-21 20:11:31,168 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8264550264550264 [2021-10-21 20:11:31,168 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1562 transitions. [2021-10-21 20:11:31,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1562 transitions. [2021-10-21 20:11:31,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:31,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1562 transitions. [2021-10-21 20:11:31,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.77777777777777) internal successors, (1562), 18 states have internal predecessors, (1562), 0 states have call successors, (0), 0 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 20:11:31,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 105.0) internal successors, (1995), 19 states have internal predecessors, (1995), 0 states have call successors, (0), 0 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 20:11:31,186 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 105.0) internal successors, (1995), 19 states have internal predecessors, (1995), 0 states have call successors, (0), 0 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 20:11:31,186 INFO L186 Difference]: Start difference. First operand has 150 places, 109 transitions, 544 flow. Second operand 18 states and 1562 transitions. [2021-10-21 20:11:31,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 152 transitions, 1247 flow [2021-10-21 20:11:31,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 1173 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-10-21 20:11:31,230 INFO L242 Difference]: Finished difference. Result has 164 places, 112 transitions, 634 flow [2021-10-21 20:11:31,231 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=634, PETRI_PLACES=164, PETRI_TRANSITIONS=112} [2021-10-21 20:11:31,232 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 54 predicate places. [2021-10-21 20:11:31,232 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 112 transitions, 634 flow [2021-10-21 20:11:31,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 0 states have call successors, (0), 0 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 20:11:31,233 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:31,233 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:31,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:11:31,234 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1102431185, now seen corresponding path program 1 times [2021-10-21 20:11:31,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:31,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003390330] [2021-10-21 20:11:31,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:31,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:31,388 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 20:11:31,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:31,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003390330] [2021-10-21 20:11:31,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003390330] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:31,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:31,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 20:11:31,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936938578] [2021-10-21 20:11:31,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:11:31,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:11:31,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:11:31,393 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-10-21 20:11:31,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 112 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 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 20:11:31,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:31,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-10-21 20:11:31,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:32,543 INFO L129 PetriNetUnfolder]: 1838/4663 cut-off events. [2021-10-21 20:11:32,543 INFO L130 PetriNetUnfolder]: For 21260/21506 co-relation queries the response was YES. [2021-10-21 20:11:32,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13874 conditions, 4663 events. 1838/4663 cut-off events. For 21260/21506 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 47199 event pairs, 370 based on Foata normal form. 24/4175 useless extension candidates. Maximal degree in co-relation 13775. Up to 1177 conditions per place. [2021-10-21 20:11:32,652 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 24 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2021-10-21 20:11:32,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 139 transitions, 750 flow [2021-10-21 20:11:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:11:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 20:11:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2021-10-21 20:11:32,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9076190476190477 [2021-10-21 20:11:32,655 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2021-10-21 20:11:32,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2021-10-21 20:11:32,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:32,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2021-10-21 20:11:32,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 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 20:11:32,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 20:11:32,749 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 20:11:32,750 INFO L186 Difference]: Start difference. First operand has 164 places, 112 transitions, 634 flow. Second operand 10 states and 953 transitions. [2021-10-21 20:11:32,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 139 transitions, 750 flow [2021-10-21 20:11:32,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 139 transitions, 693 flow, removed 15 selfloop flow, removed 16 redundant places. [2021-10-21 20:11:32,844 INFO L242 Difference]: Finished difference. Result has 154 places, 124 transitions, 671 flow [2021-10-21 20:11:32,845 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=671, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2021-10-21 20:11:32,846 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 44 predicate places. [2021-10-21 20:11:32,846 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 671 flow [2021-10-21 20:11:32,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 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 20:11:32,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:32,846 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:32,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 20:11:32,847 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:32,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1649979189, now seen corresponding path program 1 times [2021-10-21 20:11:32,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:32,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200508894] [2021-10-21 20:11:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:32,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:32,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:32,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200508894] [2021-10-21 20:11:32,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200508894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:32,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:32,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 20:11:32,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497515561] [2021-10-21 20:11:32,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 20:11:32,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:32,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 20:11:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:11:32,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-10-21 20:11:32,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 671 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:32,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:32,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-10-21 20:11:32,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:34,138 INFO L129 PetriNetUnfolder]: 1508/4151 cut-off events. [2021-10-21 20:11:34,139 INFO L130 PetriNetUnfolder]: For 14193/18022 co-relation queries the response was YES. [2021-10-21 20:11:34,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15014 conditions, 4151 events. 1508/4151 cut-off events. For 14193/18022 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 44869 event pairs, 22 based on Foata normal form. 732/4508 useless extension candidates. Maximal degree in co-relation 14921. Up to 1504 conditions per place. [2021-10-21 20:11:34,230 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 32 changer transitions 11/157 dead transitions. [2021-10-21 20:11:34,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 157 transitions, 999 flow [2021-10-21 20:11:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 20:11:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-21 20:11:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1240 transitions. [2021-10-21 20:11:34,235 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2021-10-21 20:11:34,235 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1240 transitions. [2021-10-21 20:11:34,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1240 transitions. [2021-10-21 20:11:34,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:34,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1240 transitions. [2021-10-21 20:11:34,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.38461538461539) internal successors, (1240), 13 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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 20:11:34,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 20:11:34,248 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 20:11:34,403 INFO L186 Difference]: Start difference. First operand has 154 places, 124 transitions, 671 flow. Second operand 13 states and 1240 transitions. [2021-10-21 20:11:34,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 157 transitions, 999 flow [2021-10-21 20:11:34,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 157 transitions, 991 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-10-21 20:11:34,468 INFO L242 Difference]: Finished difference. Result has 168 places, 140 transitions, 875 flow [2021-10-21 20:11:34,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=875, PETRI_PLACES=168, PETRI_TRANSITIONS=140} [2021-10-21 20:11:34,469 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 58 predicate places. [2021-10-21 20:11:34,470 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 140 transitions, 875 flow [2021-10-21 20:11:34,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:34,470 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:34,471 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:34,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 20:11:34,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -265636811, now seen corresponding path program 1 times [2021-10-21 20:11:34,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:34,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130687885] [2021-10-21 20:11:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:34,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:34,630 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 20:11:34,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:34,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130687885] [2021-10-21 20:11:34,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130687885] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:34,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:34,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:11:34,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104332010] [2021-10-21 20:11:34,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 20:11:34,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 20:11:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:11:34,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-10-21 20:11:34,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 140 transitions, 875 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:34,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:34,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-10-21 20:11:34,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:35,687 INFO L129 PetriNetUnfolder]: 1206/3678 cut-off events. [2021-10-21 20:11:35,687 INFO L130 PetriNetUnfolder]: For 18639/24938 co-relation queries the response was YES. [2021-10-21 20:11:35,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15349 conditions, 3678 events. 1206/3678 cut-off events. For 18639/24938 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 41866 event pairs, 0 based on Foata normal form. 790/4107 useless extension candidates. Maximal degree in co-relation 15251. Up to 1211 conditions per place. [2021-10-21 20:11:35,738 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 16 selfloop transitions, 36 changer transitions 20/166 dead transitions. [2021-10-21 20:11:35,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 166 transitions, 1193 flow [2021-10-21 20:11:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-21 20:11:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-21 20:11:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1512 transitions. [2021-10-21 20:11:35,744 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-10-21 20:11:35,744 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1512 transitions. [2021-10-21 20:11:35,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1512 transitions. [2021-10-21 20:11:35,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:35,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1512 transitions. [2021-10-21 20:11:35,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 94.5) internal successors, (1512), 16 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 20:11:35,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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 20:11:35,756 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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 20:11:35,756 INFO L186 Difference]: Start difference. First operand has 168 places, 140 transitions, 875 flow. Second operand 16 states and 1512 transitions. [2021-10-21 20:11:35,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 166 transitions, 1193 flow [2021-10-21 20:11:36,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 936 flow, removed 111 selfloop flow, removed 18 redundant places. [2021-10-21 20:11:36,198 INFO L242 Difference]: Finished difference. Result has 172 places, 140 transitions, 768 flow [2021-10-21 20:11:36,199 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=768, PETRI_PLACES=172, PETRI_TRANSITIONS=140} [2021-10-21 20:11:36,199 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 62 predicate places. [2021-10-21 20:11:36,199 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 140 transitions, 768 flow [2021-10-21 20:11:36,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:11:36,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:36,201 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:36,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 20:11:36,201 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1900353828, now seen corresponding path program 1 times [2021-10-21 20:11:36,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:36,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642260083] [2021-10-21 20:11:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:36,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:36,544 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 20:11:36,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:36,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642260083] [2021-10-21 20:11:36,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642260083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:36,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:36,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 20:11:36,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253332802] [2021-10-21 20:11:36,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 20:11:36,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 20:11:36,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-21 20:11:36,549 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2021-10-21 20:11:36,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 140 transitions, 768 flow. Second operand has 12 states, 12 states have (on average 83.58333333333333) internal successors, (1003), 12 states have internal predecessors, (1003), 0 states have call successors, (0), 0 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 20:11:36,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 20:11:36,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2021-10-21 20:11:36,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 20:11:37,374 INFO L129 PetriNetUnfolder]: 902/3688 cut-off events. [2021-10-21 20:11:37,375 INFO L130 PetriNetUnfolder]: For 10085/10577 co-relation queries the response was YES. [2021-10-21 20:11:37,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11715 conditions, 3688 events. 902/3688 cut-off events. For 10085/10577 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 46037 event pairs, 0 based on Foata normal form. 21/3471 useless extension candidates. Maximal degree in co-relation 11617. Up to 459 conditions per place. [2021-10-21 20:11:37,410 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 19 selfloop transitions, 9 changer transitions 22/154 dead transitions. [2021-10-21 20:11:37,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 154 transitions, 989 flow [2021-10-21 20:11:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:11:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-21 20:11:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 851 transitions. [2021-10-21 20:11:37,420 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8104761904761905 [2021-10-21 20:11:37,421 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 851 transitions. [2021-10-21 20:11:37,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 851 transitions. [2021-10-21 20:11:37,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:11:37,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 851 transitions. [2021-10-21 20:11:37,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 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 20:11:37,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 20:11:37,431 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 20:11:37,432 INFO L186 Difference]: Start difference. First operand has 172 places, 140 transitions, 768 flow. Second operand 10 states and 851 transitions. [2021-10-21 20:11:37,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 154 transitions, 989 flow [2021-10-21 20:11:37,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 154 transitions, 838 flow, removed 51 selfloop flow, removed 20 redundant places. [2021-10-21 20:11:37,706 INFO L242 Difference]: Finished difference. Result has 162 places, 131 transitions, 652 flow [2021-10-21 20:11:37,706 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=652, PETRI_PLACES=162, PETRI_TRANSITIONS=131} [2021-10-21 20:11:37,707 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 52 predicate places. [2021-10-21 20:11:37,707 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 131 transitions, 652 flow [2021-10-21 20:11:37,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.58333333333333) internal successors, (1003), 12 states have internal predecessors, (1003), 0 states have call successors, (0), 0 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 20:11:37,708 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 20:11:37,708 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:37,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 20:11:37,708 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 20:11:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash 571769524, now seen corresponding path program 2 times [2021-10-21 20:11:37,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:37,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530984212] [2021-10-21 20:11:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:37,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:11:37,783 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:11:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:11:37,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:11:37,952 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 20:11:37,953 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:11:37,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:11:37,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-21 20:11:37,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-21 20:11:37,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-21 20:11:37,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:11:37,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 20:11:37,968 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-21 20:11:37,968 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:11:38,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:11:38 BasicIcfg [2021-10-21 20:11:38,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:11:38,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:11:38,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:11:38,208 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:11:38,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:11:20" (3/4) ... [2021-10-21 20:11:38,212 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 20:11:38,459 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:11:38,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:11:38,461 INFO L168 Benchmark]: Toolchain (without parser) took 21949.10 ms. Allocated memory was 83.9 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 45.6 MB in the beginning and 911.5 MB in the end (delta: -866.0 MB). Peak memory consumption was 384.7 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,462 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 83.9 MB. Free memory was 47.2 MB in the beginning and 47.2 MB in the end (delta: 45.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:11:38,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.88 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 45.3 MB in the beginning and 67.1 MB in the end (delta: -21.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.15 ms. Allocated memory is still 100.7 MB. Free memory was 67.1 MB in the beginning and 64.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,465 INFO L168 Benchmark]: Boogie Preprocessor took 96.48 ms. Allocated memory is still 100.7 MB. Free memory was 64.1 MB in the beginning and 62.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,466 INFO L168 Benchmark]: RCFGBuilder took 2557.12 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 62.0 MB in the beginning and 92.5 MB in the end (delta: -30.6 MB). Peak memory consumption was 35.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,467 INFO L168 Benchmark]: TraceAbstraction took 18032.78 ms. Allocated memory was 127.9 MB in the beginning and 555.7 MB in the end (delta: 427.8 MB). Free memory was 92.5 MB in the beginning and 151.3 MB in the end (delta: -58.8 MB). Peak memory consumption was 368.9 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,467 INFO L168 Benchmark]: Witness Printer took 251.56 ms. Allocated memory was 555.7 MB in the beginning and 1.1 GB in the end (delta: 555.7 MB). Free memory was 151.3 MB in the beginning and 911.5 MB in the end (delta: -760.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-21 20:11:38,470 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.31 ms. Allocated memory is still 83.9 MB. Free memory was 47.2 MB in the beginning and 47.2 MB in the end (delta: 45.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 872.88 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 45.3 MB in the beginning and 67.1 MB in the end (delta: -21.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.15 ms. Allocated memory is still 100.7 MB. Free memory was 67.1 MB in the beginning and 64.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.48 ms. Allocated memory is still 100.7 MB. Free memory was 64.1 MB in the beginning and 62.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2557.12 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 62.0 MB in the beginning and 92.5 MB in the end (delta: -30.6 MB). Peak memory consumption was 35.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18032.78 ms. Allocated memory was 127.9 MB in the beginning and 555.7 MB in the end (delta: 427.8 MB). Free memory was 92.5 MB in the beginning and 151.3 MB in the end (delta: -58.8 MB). Peak memory consumption was 368.9 MB. Max. memory is 16.1 GB. * Witness Printer took 251.56 ms. Allocated memory was 555.7 MB in the beginning and 1.1 GB in the end (delta: 555.7 MB). Free memory was 151.3 MB in the beginning and 911.5 MB in the end (delta: -760.2 MB). Peak memory consumption was 16.8 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 19.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17587.4ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 12932.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 119.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 151 SDtfs, 491 SDslu, 571 SDs, 0 SdLazy, 1009 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1514.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2239.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=12, InterpolantAutomatonStates: 164, 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: 93.8ms SsaConstructionTime, 944.3ms SatisfiabilityAnalysisTime, 2931.7ms InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 5333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 20:11:38,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ab8384c-1e65-4ed6-9436-163527b38e49/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...