./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:45:12,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:45:12,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:45:12,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:45:12,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:45:12,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:45:12,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:45:12,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:45:12,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:45:12,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:45:12,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:45:12,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:45:12,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:45:12,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:45:12,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:45:12,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:45:12,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:45:12,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:45:12,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:45:12,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:45:12,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:45:12,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:45:12,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:45:12,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:45:12,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:45:12,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:45:12,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:45:12,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:45:12,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:45:12,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:45:12,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:45:12,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:45:12,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:45:12,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:45:12,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:45:12,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:45:12,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:45:12,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:45:12,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:45:12,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:45:12,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:45:12,447 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:45:12,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:45:12,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:45:12,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:45:12,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:45:12,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:45:12,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:45:12,476 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:45:12,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:45:12,476 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:45:12,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:45:12,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:45:12,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:45:12,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:45:12,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:45:12,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:45:12,478 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:45:12,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:45:12,479 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:45:12,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:45:12,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:45:12,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:45:12,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:45:12,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:45:12,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:45:12,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:45:12,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:45:12,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:45:12,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:45:12,481 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:45:12,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:45:12,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:45:12,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:45:12,482 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_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 [2021-10-28 09:45:12,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:45:12,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:45:12,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:45:12,821 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:45:12,822 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:45:12,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2021-10-28 09:45:12,907 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/data/024c1b02b/ed092d8a7d8b4ddbacb484b2de36f7ff/FLAG0ca9afade [2021-10-28 09:45:13,341 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:45:13,341 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2021-10-28 09:45:13,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/data/024c1b02b/ed092d8a7d8b4ddbacb484b2de36f7ff/FLAG0ca9afade [2021-10-28 09:45:13,727 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/data/024c1b02b/ed092d8a7d8b4ddbacb484b2de36f7ff [2021-10-28 09:45:13,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:45:13,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:45:13,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:45:13,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:45:13,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:45:13,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:45:13" (1/1) ... [2021-10-28 09:45:13,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3f2e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:13, skipping insertion in model container [2021-10-28 09:45:13,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:45:13" (1/1) ... [2021-10-28 09:45:13,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:45:13,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:45:13,980 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_d65802a0-5bce-4946-b224-0e3c09bedc1a/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2950,2963] [2021-10-28 09:45:13,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:45:13,992 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:45:14,012 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_d65802a0-5bce-4946-b224-0e3c09bedc1a/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2950,2963] [2021-10-28 09:45:14,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:45:14,028 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:45:14,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14 WrapperNode [2021-10-28 09:45:14,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:45:14,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:45:14,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:45:14,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:45:14,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:45:14,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:45:14,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:45:14,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:45:14,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:45:14,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:45:14,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:45:14,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:45:14,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (1/1) ... [2021-10-28 09:45:14,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:45:14,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:45:14,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:45:14,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:45:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-28 09:45:14,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-28 09:45:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-28 09:45:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-28 09:45:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-28 09:45:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-28 09:45:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:45:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:45:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:45:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 09:45:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 09:45:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:45:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:45:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 09:45:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:45:14,204 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 09:45:14,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:45:14,533 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-28 09:45:14,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:45:14 BoogieIcfgContainer [2021-10-28 09:45:14,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:45:14,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:45:14,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:45:14,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:45:14,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:45:13" (1/3) ... [2021-10-28 09:45:14,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6f1b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:45:14, skipping insertion in model container [2021-10-28 09:45:14,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:45:14" (2/3) ... [2021-10-28 09:45:14,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6f1b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:45:14, skipping insertion in model container [2021-10-28 09:45:14,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:45:14" (3/3) ... [2021-10-28 09:45:14,545 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2021-10-28 09:45:14,550 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 09:45:14,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:45:14,551 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 09:45:14,551 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 09:45:14,585 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,586 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,587 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,587 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,587 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,588 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,588 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,588 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,589 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,589 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,589 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,590 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,590 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,590 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,591 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,591 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,592 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,592 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,593 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,593 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,595 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,595 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,595 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,596 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,597 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,597 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,601 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,602 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,602 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,602 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,602 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,605 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,605 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,606 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,608 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,608 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:45:14,620 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-28 09:45:14,672 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:45:14,680 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:45:14,680 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-28 09:45:14,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 99 transitions, 222 flow [2021-10-28 09:45:14,760 INFO L129 PetriNetUnfolder]: 7/96 cut-off events. [2021-10-28 09:45:14,760 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-28 09:45:14,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 7/96 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-10-28 09:45:14,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 99 transitions, 222 flow [2021-10-28 09:45:14,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 86 transitions, 190 flow [2021-10-28 09:45:14,806 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2021-10-28 09:45:14,806 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-28 09:45:14,807 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:14,808 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-28 09:45:14,808 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1023282716, now seen corresponding path program 1 times [2021-10-28 09:45:14,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:14,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227478219] [2021-10-28 09:45:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:14,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:15,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:15,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227478219] [2021-10-28 09:45:15,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227478219] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:15,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:15,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:45:15,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812633489] [2021-10-28 09:45:15,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:45:15,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:45:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:45:15,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2021-10-28 09:45:15,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:15,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:15,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2021-10-28 09:45:15,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:16,040 INFO L129 PetriNetUnfolder]: 175/582 cut-off events. [2021-10-28 09:45:16,040 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-10-28 09:45:16,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 582 events. 175/582 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3216 event pairs, 17 based on Foata normal form. 34/534 useless extension candidates. Maximal degree in co-relation 775. Up to 103 conditions per place. [2021-10-28 09:45:16,050 INFO L132 encePairwiseOnDemand]: 85/99 looper letters, 32 selfloop transitions, 9 changer transitions 28/131 dead transitions. [2021-10-28 09:45:16,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 131 transitions, 421 flow [2021-10-28 09:45:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:45:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:45:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 750 transitions. [2021-10-28 09:45:16,070 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2021-10-28 09:45:16,071 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 750 transitions. [2021-10-28 09:45:16,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 750 transitions. [2021-10-28 09:45:16,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:16,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 750 transitions. [2021-10-28 09:45:16,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,095 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,098 INFO L186 Difference]: Start difference. First operand has 89 places, 86 transitions, 190 flow. Second operand 9 states and 750 transitions. [2021-10-28 09:45:16,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 131 transitions, 421 flow [2021-10-28 09:45:16,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 131 transitions, 407 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-10-28 09:45:16,109 INFO L242 Difference]: Finished difference. Result has 96 places, 86 transitions, 231 flow [2021-10-28 09:45:16,112 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=231, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2021-10-28 09:45:16,114 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2021-10-28 09:45:16,115 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 231 flow [2021-10-28 09:45:16,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,116 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:16,117 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-28 09:45:16,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:45:16,118 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1318437206, now seen corresponding path program 2 times [2021-10-28 09:45:16,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:16,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240906068] [2021-10-28 09:45:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:16,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:16,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:16,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240906068] [2021-10-28 09:45:16,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240906068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:16,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:16,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:45:16,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426913030] [2021-10-28 09:45:16,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:45:16,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:45:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:45:16,498 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 99 [2021-10-28 09:45:16,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:16,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 99 [2021-10-28 09:45:16,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:16,687 INFO L129 PetriNetUnfolder]: 81/336 cut-off events. [2021-10-28 09:45:16,687 INFO L130 PetriNetUnfolder]: For 212/255 co-relation queries the response was YES. [2021-10-28 09:45:16,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 336 events. 81/336 cut-off events. For 212/255 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1456 event pairs, 2 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 532. Up to 60 conditions per place. [2021-10-28 09:45:16,696 INFO L132 encePairwiseOnDemand]: 91/99 looper letters, 17 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2021-10-28 09:45:16,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 98 transitions, 339 flow [2021-10-28 09:45:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:45:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-28 09:45:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2021-10-28 09:45:16,700 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847041847041847 [2021-10-28 09:45:16,700 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 587 transitions. [2021-10-28 09:45:16,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 587 transitions. [2021-10-28 09:45:16,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:16,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 587 transitions. [2021-10-28 09:45:16,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,707 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,707 INFO L186 Difference]: Start difference. First operand has 96 places, 86 transitions, 231 flow. Second operand 7 states and 587 transitions. [2021-10-28 09:45:16,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 98 transitions, 339 flow [2021-10-28 09:45:16,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 328 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-10-28 09:45:16,717 INFO L242 Difference]: Finished difference. Result has 99 places, 91 transitions, 282 flow [2021-10-28 09:45:16,717 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2021-10-28 09:45:16,718 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2021-10-28 09:45:16,718 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 282 flow [2021-10-28 09:45:16,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:16,720 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-28 09:45:16,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:45:16,720 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1593187056, now seen corresponding path program 3 times [2021-10-28 09:45:16,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:16,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517314924] [2021-10-28 09:45:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:16,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:16,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:16,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517314924] [2021-10-28 09:45:16,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517314924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:16,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:16,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:45:16,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088228130] [2021-10-28 09:45:16,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:45:16,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:16,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:45:16,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:45:16,986 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2021-10-28 09:45:16,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:16,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:16,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2021-10-28 09:45:16,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:17,206 INFO L129 PetriNetUnfolder]: 121/393 cut-off events. [2021-10-28 09:45:17,206 INFO L130 PetriNetUnfolder]: For 639/1087 co-relation queries the response was YES. [2021-10-28 09:45:17,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 393 events. 121/393 cut-off events. For 639/1087 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1841 event pairs, 11 based on Foata normal form. 11/362 useless extension candidates. Maximal degree in co-relation 880. Up to 108 conditions per place. [2021-10-28 09:45:17,212 INFO L132 encePairwiseOnDemand]: 88/99 looper letters, 26 selfloop transitions, 7 changer transitions 22/117 dead transitions. [2021-10-28 09:45:17,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 117 transitions, 510 flow [2021-10-28 09:45:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:45:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:45:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 718 transitions. [2021-10-28 09:45:17,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8058361391694725 [2021-10-28 09:45:17,217 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 718 transitions. [2021-10-28 09:45:17,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 718 transitions. [2021-10-28 09:45:17,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:17,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 718 transitions. [2021-10-28 09:45:17,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.77777777777777) internal successors, (718), 9 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,224 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,224 INFO L186 Difference]: Start difference. First operand has 99 places, 91 transitions, 282 flow. Second operand 9 states and 718 transitions. [2021-10-28 09:45:17,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 117 transitions, 510 flow [2021-10-28 09:45:17,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 117 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:45:17,232 INFO L242 Difference]: Finished difference. Result has 109 places, 88 transitions, 276 flow [2021-10-28 09:45:17,232 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2021-10-28 09:45:17,233 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2021-10-28 09:45:17,233 INFO L470 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 276 flow [2021-10-28 09:45:17,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,234 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:17,234 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:17,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:45:17,234 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash 178854303, now seen corresponding path program 1 times [2021-10-28 09:45:17,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:17,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379501072] [2021-10-28 09:45:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:17,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:17,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:17,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379501072] [2021-10-28 09:45:17,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379501072] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:17,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:17,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:45:17,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564318770] [2021-10-28 09:45:17,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:45:17,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:17,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:45:17,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:45:17,380 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 99 [2021-10-28 09:45:17,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:17,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 99 [2021-10-28 09:45:17,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:17,614 INFO L129 PetriNetUnfolder]: 219/699 cut-off events. [2021-10-28 09:45:17,614 INFO L130 PetriNetUnfolder]: For 965/1367 co-relation queries the response was YES. [2021-10-28 09:45:17,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 699 events. 219/699 cut-off events. For 965/1367 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4038 event pairs, 10 based on Foata normal form. 38/689 useless extension candidates. Maximal degree in co-relation 1534. Up to 104 conditions per place. [2021-10-28 09:45:17,626 INFO L132 encePairwiseOnDemand]: 90/99 looper letters, 36 selfloop transitions, 29 changer transitions 0/135 dead transitions. [2021-10-28 09:45:17,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 135 transitions, 682 flow [2021-10-28 09:45:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:45:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:45:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions. [2021-10-28 09:45:17,630 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810325476992144 [2021-10-28 09:45:17,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions. [2021-10-28 09:45:17,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions. [2021-10-28 09:45:17,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:17,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions. [2021-10-28 09:45:17,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,637 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,637 INFO L186 Difference]: Start difference. First operand has 109 places, 88 transitions, 276 flow. Second operand 9 states and 785 transitions. [2021-10-28 09:45:17,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 135 transitions, 682 flow [2021-10-28 09:45:17,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 135 transitions, 602 flow, removed 33 selfloop flow, removed 9 redundant places. [2021-10-28 09:45:17,648 INFO L242 Difference]: Finished difference. Result has 110 places, 116 transitions, 552 flow [2021-10-28 09:45:17,648 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2021-10-28 09:45:17,648 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 21 predicate places. [2021-10-28 09:45:17,649 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 552 flow [2021-10-28 09:45:17,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,649 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:17,649 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:17,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:45:17,650 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash 608344077, now seen corresponding path program 2 times [2021-10-28 09:45:17,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:17,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027962462] [2021-10-28 09:45:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:17,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:17,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:17,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027962462] [2021-10-28 09:45:17,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027962462] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:17,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:17,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:45:17,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937317557] [2021-10-28 09:45:17,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:45:17,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:45:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:45:17,742 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99 [2021-10-28 09:45:17,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 552 flow. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:17,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99 [2021-10-28 09:45:17,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:17,862 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L76-->L78: Formula: (= v_~pos~0_7 (+ v_~pos~0_8 (- 2))) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][82], [Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 126#true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 40#L110-4true, Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 49#L78true, Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true]) [2021-10-28 09:45:17,863 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-10-28 09:45:17,863 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-10-28 09:45:17,863 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:17,863 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-10-28 09:45:17,884 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([256] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][73], [132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 7#L59true, Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true]) [2021-10-28 09:45:17,885 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is not cut-off event [2021-10-28 09:45:17,885 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:17,885 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:17,885 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is not cut-off event [2021-10-28 09:45:17,914 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][95], [170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 7#L59true, Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), 184#true, Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 126#true]) [2021-10-28 09:45:17,914 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-10-28 09:45:17,914 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-10-28 09:45:17,915 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-10-28 09:45:17,915 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-10-28 09:45:17,915 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][101], [172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 27#L70true, Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 7#L59true, Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), 184#true, Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 126#true]) [2021-10-28 09:45:17,915 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-10-28 09:45:17,915 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,916 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,916 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,920 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][87], [6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 27#L70true, Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 7#L59true, Black: 109#(<= 0 ~pos~0), 184#true, Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 126#true]) [2021-10-28 09:45:17,921 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-10-28 09:45:17,921 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,921 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,921 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,933 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][87], [6#L111-4true, 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, 27#L70true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 7#L59true, Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true, 126#true]) [2021-10-28 09:45:17,933 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-10-28 09:45:17,934 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,934 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,934 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:17,934 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-10-28 09:45:17,938 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][95], [170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 7#L59true, Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true, 126#true]) [2021-10-28 09:45:17,939 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-10-28 09:45:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-10-28 09:45:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-10-28 09:45:17,939 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-10-28 09:45:17,960 INFO L129 PetriNetUnfolder]: 224/823 cut-off events. [2021-10-28 09:45:17,960 INFO L130 PetriNetUnfolder]: For 1798/2047 co-relation queries the response was YES. [2021-10-28 09:45:17,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 823 events. 224/823 cut-off events. For 1798/2047 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5225 event pairs, 11 based on Foata normal form. 18/757 useless extension candidates. Maximal degree in co-relation 2123. Up to 134 conditions per place. [2021-10-28 09:45:17,976 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 6 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2021-10-28 09:45:17,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 578 flow [2021-10-28 09:45:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:45:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-28 09:45:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2021-10-28 09:45:17,979 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8828282828282829 [2021-10-28 09:45:17,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 437 transitions. [2021-10-28 09:45:17,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 437 transitions. [2021-10-28 09:45:17,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:17,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 437 transitions. [2021-10-28 09:45:17,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,983 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,984 INFO L186 Difference]: Start difference. First operand has 110 places, 116 transitions, 552 flow. Second operand 5 states and 437 transitions. [2021-10-28 09:45:17,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 578 flow [2021-10-28 09:45:17,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 118 transitions, 570 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-10-28 09:45:17,995 INFO L242 Difference]: Finished difference. Result has 116 places, 118 transitions, 570 flow [2021-10-28 09:45:17,996 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=570, PETRI_PLACES=116, PETRI_TRANSITIONS=118} [2021-10-28 09:45:17,996 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 27 predicate places. [2021-10-28 09:45:17,996 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 118 transitions, 570 flow [2021-10-28 09:45:17,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:17,997 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:17,997 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:17,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:45:17,997 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 237685433, now seen corresponding path program 1 times [2021-10-28 09:45:17,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:17,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379693134] [2021-10-28 09:45:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:17,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:18,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:18,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379693134] [2021-10-28 09:45:18,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379693134] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:18,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:18,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:45:18,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468826407] [2021-10-28 09:45:18,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:45:18,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:18,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:45:18,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:45:18,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99 [2021-10-28 09:45:18,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 118 transitions, 570 flow. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:18,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:18,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99 [2021-10-28 09:45:18,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:18,303 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][90], [Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 194#true, Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 7#L59true, Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true, 126#true]) [2021-10-28 09:45:18,303 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2021-10-28 09:45:18,303 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:18,304 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2021-10-28 09:45:18,304 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:18,313 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][97], [Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, 27#L70true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 194#true, Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 7#L59true, Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true, 126#true]) [2021-10-28 09:45:18,313 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2021-10-28 09:45:18,314 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2021-10-28 09:45:18,314 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2021-10-28 09:45:18,314 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-10-28 09:45:18,319 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][90], [Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), 194#true, Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 7#L59true, Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), 184#true, Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 126#true]) [2021-10-28 09:45:18,319 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-10-28 09:45:18,319 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:18,319 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:18,319 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-10-28 09:45:18,320 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:18,322 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][90], [Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 94#L92true, Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 194#true, Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 7#L59true, Black: 109#(<= 0 ~pos~0), 184#true, Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 126#true]) [2021-10-28 09:45:18,323 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-10-28 09:45:18,323 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:18,323 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:18,323 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-10-28 09:45:18,324 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-10-28 09:45:18,324 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-10-28 09:45:18,366 INFO L129 PetriNetUnfolder]: 247/1001 cut-off events. [2021-10-28 09:45:18,367 INFO L130 PetriNetUnfolder]: For 1884/2018 co-relation queries the response was YES. [2021-10-28 09:45:18,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1001 events. 247/1001 cut-off events. For 1884/2018 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7129 event pairs, 24 based on Foata normal form. 20/960 useless extension candidates. Maximal degree in co-relation 2622. Up to 140 conditions per place. [2021-10-28 09:45:18,386 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 6 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2021-10-28 09:45:18,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 596 flow [2021-10-28 09:45:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:45:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-28 09:45:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2021-10-28 09:45:18,388 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8828282828282829 [2021-10-28 09:45:18,389 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 437 transitions. [2021-10-28 09:45:18,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 437 transitions. [2021-10-28 09:45:18,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:18,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 437 transitions. [2021-10-28 09:45:18,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:18,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:18,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:18,393 INFO L186 Difference]: Start difference. First operand has 116 places, 118 transitions, 570 flow. Second operand 5 states and 437 transitions. [2021-10-28 09:45:18,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 596 flow [2021-10-28 09:45:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:45:18,404 INFO L242 Difference]: Finished difference. Result has 120 places, 120 transitions, 592 flow [2021-10-28 09:45:18,404 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=592, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2021-10-28 09:45:18,405 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2021-10-28 09:45:18,405 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 592 flow [2021-10-28 09:45:18,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:18,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:18,406 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:18,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:45:18,407 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash 127856162, now seen corresponding path program 1 times [2021-10-28 09:45:18,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:18,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769720014] [2021-10-28 09:45:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:18,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:18,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:18,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769720014] [2021-10-28 09:45:18,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769720014] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:18,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835660336] [2021-10-28 09:45:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:18,593 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:45:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:45:18,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:45:18,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 09:45:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:18,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-28 09:45:18,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:45:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:19,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835660336] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:19,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:45:19,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-10-28 09:45:19,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094744149] [2021-10-28 09:45:19,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:45:19,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:45:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:45:19,303 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2021-10-28 09:45:19,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 592 flow. Second operand has 12 states, 12 states have (on average 76.08333333333333) internal successors, (913), 12 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:19,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:19,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2021-10-28 09:45:19,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:20,037 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 194#true, Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 49#L78true, Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 204#true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0)]) [2021-10-28 09:45:20,038 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,038 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,038 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,038 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,094 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 194#true, Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 49#L78true, Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 204#true]) [2021-10-28 09:45:20,095 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,095 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,095 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,095 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,095 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,106 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 194#true, Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 204#true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0)]) [2021-10-28 09:45:20,106 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,107 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-10-28 09:45:20,107 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-10-28 09:45:20,108 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,182 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 194#true, Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 21#L54true, Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 204#true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0)]) [2021-10-28 09:45:20,182 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,183 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,183 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-10-28 09:45:20,183 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-10-28 09:45:20,183 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,184 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 27#L70true, Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), 194#true, Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 204#true]) [2021-10-28 09:45:20,185 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-10-28 09:45:20,185 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-10-28 09:45:20,185 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-10-28 09:45:20,185 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-10-28 09:45:20,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), 194#true, Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 49#L78true, Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 204#true]) [2021-10-28 09:45:20,210 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-10-28 09:45:20,210 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,210 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,210 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,211 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 194#true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 49#L78true, Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 204#true]) [2021-10-28 09:45:20,211 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-10-28 09:45:20,212 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,212 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,212 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,212 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:20,212 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:20,225 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][102], [Black: 184#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 37#L83true, 6#L111-4true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 126#true, 94#L92true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), 194#true, Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 21#L54true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 204#true]) [2021-10-28 09:45:20,225 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2021-10-28 09:45:20,226 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,226 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-10-28 09:45:20,226 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,226 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-10-28 09:45:20,226 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-10-28 09:45:20,245 INFO L129 PetriNetUnfolder]: 1071/3154 cut-off events. [2021-10-28 09:45:20,245 INFO L130 PetriNetUnfolder]: For 8646/8725 co-relation queries the response was YES. [2021-10-28 09:45:20,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10488 conditions, 3154 events. 1071/3154 cut-off events. For 8646/8725 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27928 event pairs, 81 based on Foata normal form. 41/3155 useless extension candidates. Maximal degree in co-relation 9937. Up to 629 conditions per place. [2021-10-28 09:45:20,301 INFO L132 encePairwiseOnDemand]: 86/99 looper letters, 119 selfloop transitions, 46 changer transitions 3/243 dead transitions. [2021-10-28 09:45:20,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 243 transitions, 1871 flow [2021-10-28 09:45:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:45:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:45:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1137 transitions. [2021-10-28 09:45:20,307 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8203463203463204 [2021-10-28 09:45:20,307 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1137 transitions. [2021-10-28 09:45:20,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1137 transitions. [2021-10-28 09:45:20,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:20,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1137 transitions. [2021-10-28 09:45:20,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 81.21428571428571) internal successors, (1137), 14 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:20,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 99.0) internal successors, (1485), 15 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:20,318 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 99.0) internal successors, (1485), 15 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:20,318 INFO L186 Difference]: Start difference. First operand has 120 places, 120 transitions, 592 flow. Second operand 14 states and 1137 transitions. [2021-10-28 09:45:20,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 243 transitions, 1871 flow [2021-10-28 09:45:20,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 243 transitions, 1867 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:45:20,349 INFO L242 Difference]: Finished difference. Result has 139 places, 163 transitions, 1138 flow [2021-10-28 09:45:20,350 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1138, PETRI_PLACES=139, PETRI_TRANSITIONS=163} [2021-10-28 09:45:20,350 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 50 predicate places. [2021-10-28 09:45:20,350 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 163 transitions, 1138 flow [2021-10-28 09:45:20,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.08333333333333) internal successors, (913), 12 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:20,351 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:20,351 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:20,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 09:45:20,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:45:20,568 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash -174124312, now seen corresponding path program 2 times [2021-10-28 09:45:20,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:20,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063033442] [2021-10-28 09:45:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:20,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 09:45:20,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:20,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063033442] [2021-10-28 09:45:20,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063033442] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:20,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:20,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:45:20,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198889729] [2021-10-28 09:45:20,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:45:20,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:45:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:45:20,668 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 99 [2021-10-28 09:45:20,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 163 transitions, 1138 flow. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:20,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:20,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 99 [2021-10-28 09:45:20,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:20,828 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][80], [Black: 184#true, 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 194#true, Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 109#(<= 0 ~pos~0), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 126#true, 209#(<= 1 ~pos~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 21#L54true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 40#L110-4true, Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0))]) [2021-10-28 09:45:20,828 INFO L384 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2021-10-28 09:45:20,829 INFO L387 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2021-10-28 09:45:20,829 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:20,829 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:20,873 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][66], [Black: 184#true, 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 194#true, Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 109#(<= 0 ~pos~0), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 126#true, 209#(<= 1 ~pos~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 21#L54true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 40#L110-4true, Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0))]) [2021-10-28 09:45:20,873 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-10-28 09:45:20,873 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:20,874 INFO L387 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2021-10-28 09:45:20,874 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:21,495 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][66], [Black: 184#true, 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 194#true, 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 94#L92true, Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 21#L54true, 204#true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0))]) [2021-10-28 09:45:21,495 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-10-28 09:45:21,495 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:21,495 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:21,495 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:21,636 INFO L129 PetriNetUnfolder]: 1233/3806 cut-off events. [2021-10-28 09:45:21,636 INFO L130 PetriNetUnfolder]: For 18087/18345 co-relation queries the response was YES. [2021-10-28 09:45:21,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15314 conditions, 3806 events. 1233/3806 cut-off events. For 18087/18345 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 35904 event pairs, 49 based on Foata normal form. 216/3976 useless extension candidates. Maximal degree in co-relation 14783. Up to 655 conditions per place. [2021-10-28 09:45:21,728 INFO L132 encePairwiseOnDemand]: 90/99 looper letters, 69 selfloop transitions, 70 changer transitions 5/242 dead transitions. [2021-10-28 09:45:21,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 242 transitions, 2225 flow [2021-10-28 09:45:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:45:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-28 09:45:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 614 transitions. [2021-10-28 09:45:21,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.886002886002886 [2021-10-28 09:45:21,731 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 614 transitions. [2021-10-28 09:45:21,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 614 transitions. [2021-10-28 09:45:21,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:21,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 614 transitions. [2021-10-28 09:45:21,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.71428571428571) internal successors, (614), 7 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:21,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:21,737 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:21,737 INFO L186 Difference]: Start difference. First operand has 139 places, 163 transitions, 1138 flow. Second operand 7 states and 614 transitions. [2021-10-28 09:45:21,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 242 transitions, 2225 flow [2021-10-28 09:45:21,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 242 transitions, 2091 flow, removed 64 selfloop flow, removed 3 redundant places. [2021-10-28 09:45:21,808 INFO L242 Difference]: Finished difference. Result has 148 places, 207 transitions, 1835 flow [2021-10-28 09:45:21,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1835, PETRI_PLACES=148, PETRI_TRANSITIONS=207} [2021-10-28 09:45:21,809 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 59 predicate places. [2021-10-28 09:45:21,809 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 207 transitions, 1835 flow [2021-10-28 09:45:21,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:21,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:21,810 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:21,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:45:21,810 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1371505874, now seen corresponding path program 3 times [2021-10-28 09:45:21,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:21,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38658118] [2021-10-28 09:45:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:21,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:45:21,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:21,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38658118] [2021-10-28 09:45:21,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38658118] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:21,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:21,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:45:21,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686566363] [2021-10-28 09:45:21,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:45:21,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:45:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:45:21,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 99 [2021-10-28 09:45:21,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 207 transitions, 1835 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:21,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:21,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 99 [2021-10-28 09:45:21,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:23,222 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][60], [Black: 184#true, 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 194#true, 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 208#(<= 0 ~pos~0), 94#L92true, Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 21#L54true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 204#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 470#true, Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L111-4true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0))]) [2021-10-28 09:45:23,223 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-10-28 09:45:23,223 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:23,223 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:23,223 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:23,375 INFO L129 PetriNetUnfolder]: 1433/4504 cut-off events. [2021-10-28 09:45:23,375 INFO L130 PetriNetUnfolder]: For 30568/30933 co-relation queries the response was YES. [2021-10-28 09:45:23,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20697 conditions, 4504 events. 1433/4504 cut-off events. For 30568/30933 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 43925 event pairs, 72 based on Foata normal form. 105/4551 useless extension candidates. Maximal degree in co-relation 20054. Up to 736 conditions per place. [2021-10-28 09:45:23,458 INFO L132 encePairwiseOnDemand]: 90/99 looper letters, 68 selfloop transitions, 60 changer transitions 24/250 dead transitions. [2021-10-28 09:45:23,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 250 transitions, 2746 flow [2021-10-28 09:45:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:45:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-28 09:45:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2021-10-28 09:45:23,461 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8838383838383839 [2021-10-28 09:45:23,461 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 525 transitions. [2021-10-28 09:45:23,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 525 transitions. [2021-10-28 09:45:23,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:23,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 525 transitions. [2021-10-28 09:45:23,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:23,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:23,467 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:23,467 INFO L186 Difference]: Start difference. First operand has 148 places, 207 transitions, 1835 flow. Second operand 6 states and 525 transitions. [2021-10-28 09:45:23,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 250 transitions, 2746 flow [2021-10-28 09:45:23,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 250 transitions, 2746 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-28 09:45:23,544 INFO L242 Difference]: Finished difference. Result has 157 places, 208 transitions, 2122 flow [2021-10-28 09:45:23,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2122, PETRI_PLACES=157, PETRI_TRANSITIONS=208} [2021-10-28 09:45:23,545 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 68 predicate places. [2021-10-28 09:45:23,545 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 208 transitions, 2122 flow [2021-10-28 09:45:23,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:23,545 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:23,546 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:23,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:45:23,546 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -740839796, now seen corresponding path program 4 times [2021-10-28 09:45:23,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:23,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199069999] [2021-10-28 09:45:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:23,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:45:23,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:23,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199069999] [2021-10-28 09:45:23,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199069999] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:23,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:23,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:45:23,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439478126] [2021-10-28 09:45:23,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:45:23,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:45:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:45:23,640 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 99 [2021-10-28 09:45:23,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 208 transitions, 2122 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:23,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:23,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 99 [2021-10-28 09:45:23,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:23,833 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([240] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~pos~0][59], [Black: 184#true, 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 194#true, 109#(<= 0 ~pos~0), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 126#true, Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 209#(<= 1 ~pos~0), Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 21#L54true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 470#true, 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 40#L110-4true, Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 503#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 162#true, Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0))]) [2021-10-28 09:45:23,833 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-10-28 09:45:23,834 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:23,834 INFO L387 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2021-10-28 09:45:23,834 INFO L387 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2021-10-28 09:45:24,613 INFO L129 PetriNetUnfolder]: 1227/3857 cut-off events. [2021-10-28 09:45:24,614 INFO L130 PetriNetUnfolder]: For 32518/32874 co-relation queries the response was YES. [2021-10-28 09:45:24,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19037 conditions, 3857 events. 1227/3857 cut-off events. For 32518/32874 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 36088 event pairs, 96 based on Foata normal form. 57/3847 useless extension candidates. Maximal degree in co-relation 18477. Up to 856 conditions per place. [2021-10-28 09:45:24,695 INFO L132 encePairwiseOnDemand]: 90/99 looper letters, 72 selfloop transitions, 54 changer transitions 6/230 dead transitions. [2021-10-28 09:45:24,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 230 transitions, 2681 flow [2021-10-28 09:45:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:45:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-28 09:45:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2021-10-28 09:45:24,698 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2021-10-28 09:45:24,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 513 transitions. [2021-10-28 09:45:24,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 513 transitions. [2021-10-28 09:45:24,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:24,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 513 transitions. [2021-10-28 09:45:24,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:24,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:24,704 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:24,704 INFO L186 Difference]: Start difference. First operand has 157 places, 208 transitions, 2122 flow. Second operand 6 states and 513 transitions. [2021-10-28 09:45:24,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 230 transitions, 2681 flow [2021-10-28 09:45:24,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 230 transitions, 2633 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-28 09:45:24,799 INFO L242 Difference]: Finished difference. Result has 163 places, 210 transitions, 2241 flow [2021-10-28 09:45:24,800 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=2077, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2241, PETRI_PLACES=163, PETRI_TRANSITIONS=210} [2021-10-28 09:45:24,800 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 74 predicate places. [2021-10-28 09:45:24,800 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 210 transitions, 2241 flow [2021-10-28 09:45:24,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:24,801 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:24,801 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:24,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:45:24,802 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:24,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1517132824, now seen corresponding path program 1 times [2021-10-28 09:45:24,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:24,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838147945] [2021-10-28 09:45:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:24,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:24,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:24,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838147945] [2021-10-28 09:45:24,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838147945] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:24,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911290755] [2021-10-28 09:45:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:24,917 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:45:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:45:24,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:45:24,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 09:45:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:25,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-28 09:45:25,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:45:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:25,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911290755] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:25,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:45:25,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-10-28 09:45:25,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123912025] [2021-10-28 09:45:25,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:45:25,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:45:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:45:25,573 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99 [2021-10-28 09:45:25,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 210 transitions, 2241 flow. Second operand has 12 states, 12 states have (on average 76.25) internal successors, (915), 12 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:25,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:25,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99 [2021-10-28 09:45:25,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:27,004 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][169], [Black: 184#true, Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 194#true, Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 126#true, Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 208#(<= 0 ~pos~0), 94#L92true, Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 513#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 21#L54true, 204#true, 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 501#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 470#true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L111-4true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 162#true, Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:27,005 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,005 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,005 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,005 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,679 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][200], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 94#L92true, Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 513#true, Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 7#L59true, 126#true, 204#true, 501#true, Black: 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 470#true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L111-4true, 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 27#L70true, Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true, Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:27,680 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-10-28 09:45:27,680 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,680 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,680 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:27,708 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([243] L57-->L59: Formula: (= v_thread1Thread1of1ForFork0_~lv_assert~0_7 v_~v_assert~0_2) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0][255], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 94#L92true, Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 7#L59true, 126#true, 204#true, 501#true, Black: 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 470#true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L111-4true, 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 27#L70true, Black: 162#true, Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), 184#true, Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:27,708 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-10-28 09:45:27,708 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:27,708 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:27,708 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-10-28 09:45:27,932 INFO L129 PetriNetUnfolder]: 3352/8723 cut-off events. [2021-10-28 09:45:27,932 INFO L130 PetriNetUnfolder]: For 91858/96026 co-relation queries the response was YES. [2021-10-28 09:45:28,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47330 conditions, 8723 events. 3352/8723 cut-off events. For 91858/96026 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 85687 event pairs, 338 based on Foata normal form. 256/8831 useless extension candidates. Maximal degree in co-relation 46917. Up to 2061 conditions per place. [2021-10-28 09:45:28,056 INFO L132 encePairwiseOnDemand]: 86/99 looper letters, 124 selfloop transitions, 30 changer transitions 248/481 dead transitions. [2021-10-28 09:45:28,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 481 transitions, 6609 flow [2021-10-28 09:45:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:45:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:45:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1128 transitions. [2021-10-28 09:45:28,065 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8138528138528138 [2021-10-28 09:45:28,065 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1128 transitions. [2021-10-28 09:45:28,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1128 transitions. [2021-10-28 09:45:28,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:28,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1128 transitions. [2021-10-28 09:45:28,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 80.57142857142857) internal successors, (1128), 14 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:28,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 99.0) internal successors, (1485), 15 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:28,075 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 99.0) internal successors, (1485), 15 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:28,075 INFO L186 Difference]: Start difference. First operand has 163 places, 210 transitions, 2241 flow. Second operand 14 states and 1128 transitions. [2021-10-28 09:45:28,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 481 transitions, 6609 flow [2021-10-28 09:45:28,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 481 transitions, 6468 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-10-28 09:45:28,413 INFO L242 Difference]: Finished difference. Result has 182 places, 192 transitions, 2188 flow [2021-10-28 09:45:28,413 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2188, PETRI_PLACES=182, PETRI_TRANSITIONS=192} [2021-10-28 09:45:28,414 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 93 predicate places. [2021-10-28 09:45:28,414 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 192 transitions, 2188 flow [2021-10-28 09:45:28,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.25) internal successors, (915), 12 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:28,415 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:28,415 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:28,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-28 09:45:28,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-28 09:45:28,628 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1149315461, now seen corresponding path program 5 times [2021-10-28 09:45:28,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:28,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484458892] [2021-10-28 09:45:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:28,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 09:45:28,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:28,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484458892] [2021-10-28 09:45:28,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484458892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:28,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:28,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:45:28,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800227473] [2021-10-28 09:45:28,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:45:28,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:45:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:45:28,718 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 99 [2021-10-28 09:45:28,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 192 transitions, 2188 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:28,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:28,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 99 [2021-10-28 09:45:28,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:29,071 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([256] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][106], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 519#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 518#(<= 2 ~pos~0), Black: 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 767#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 763#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 517#(<= 0 ~pos~0), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 769#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 779#true, 204#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, 761#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 184#true, Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 94#L92true, Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 7#L59true, Black: 470#true, 37#L83true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:29,072 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2021-10-28 09:45:29,072 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:29,072 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:29,072 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:29,112 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post4, ~pos~0][150], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 519#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 518#(<= 2 ~pos~0), Black: 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 767#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 763#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 761#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 517#(<= 0 ~pos~0), Black: 769#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 126#true, 781#(= (* 256 (div ~d1~0 256)) ~d1~0), 513#true, 21#L54true, 204#true, 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 40#L110-4true, 503#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 184#true, Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 470#true, 37#L83true, Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:29,112 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-10-28 09:45:29,112 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:29,112 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-10-28 09:45:29,113 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-10-28 09:45:29,269 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([256] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][124], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 519#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 518#(<= 2 ~pos~0), Black: 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 767#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 763#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 761#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 517#(<= 0 ~pos~0), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 769#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 779#true, 513#true, 204#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 184#true, Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 94#L92true, Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 7#L59true, Black: 470#true, 37#L83true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:29,269 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2021-10-28 09:45:29,269 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2021-10-28 09:45:29,269 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2021-10-28 09:45:29,270 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2021-10-28 09:45:29,668 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post4, ~pos~0][150], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 519#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 518#(<= 2 ~pos~0), Black: 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 767#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 763#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 761#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 517#(<= 0 ~pos~0), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 769#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 781#(= (* 256 (div ~d1~0 256)) ~d1~0), 513#true, 21#L54true, 204#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 503#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 184#true, Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), 94#L92true, Black: 208#(<= 0 ~pos~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 49#L78true, 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 470#true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:29,668 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-10-28 09:45:29,668 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-10-28 09:45:29,668 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-10-28 09:45:29,669 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-10-28 09:45:29,685 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post4, ~pos~0][150], [Black: 509#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 519#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 518#(<= 2 ~pos~0), Black: 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 767#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 763#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 470#true, Black: 761#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 517#(<= 0 ~pos~0), Black: 769#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1)), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 781#(= (* 256 (div ~d1~0 256)) ~d1~0), 513#true, 21#L54true, 204#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), 6#L111-4true, Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 503#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 162#true, Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), 184#true, Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 460#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 208#(<= 0 ~pos~0), 94#L92true, Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 458#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1)), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, Black: 210#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 454#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), 37#L83true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:29,685 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2021-10-28 09:45:29,685 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-10-28 09:45:29,685 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2021-10-28 09:45:29,685 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2021-10-28 09:45:29,699 INFO L129 PetriNetUnfolder]: 971/3569 cut-off events. [2021-10-28 09:45:29,699 INFO L130 PetriNetUnfolder]: For 40134/40777 co-relation queries the response was YES. [2021-10-28 09:45:29,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18791 conditions, 3569 events. 971/3569 cut-off events. For 40134/40777 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 33780 event pairs, 174 based on Foata normal form. 151/3577 useless extension candidates. Maximal degree in co-relation 18605. Up to 561 conditions per place. [2021-10-28 09:45:29,767 INFO L132 encePairwiseOnDemand]: 94/99 looper letters, 6 selfloop transitions, 5 changer transitions 2/186 dead transitions. [2021-10-28 09:45:29,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 186 transitions, 2096 flow [2021-10-28 09:45:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:45:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-28 09:45:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions. [2021-10-28 09:45:29,770 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2021-10-28 09:45:29,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 368 transitions. [2021-10-28 09:45:29,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 368 transitions. [2021-10-28 09:45:29,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:29,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 368 transitions. [2021-10-28 09:45:29,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:29,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:29,773 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:29,774 INFO L186 Difference]: Start difference. First operand has 182 places, 192 transitions, 2188 flow. Second operand 4 states and 368 transitions. [2021-10-28 09:45:29,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 186 transitions, 2096 flow [2021-10-28 09:45:29,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 186 transitions, 1983 flow, removed 47 selfloop flow, removed 13 redundant places. [2021-10-28 09:45:29,875 INFO L242 Difference]: Finished difference. Result has 167 places, 183 transitions, 1957 flow [2021-10-28 09:45:29,876 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1957, PETRI_PLACES=167, PETRI_TRANSITIONS=183} [2021-10-28 09:45:29,876 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 78 predicate places. [2021-10-28 09:45:29,876 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 183 transitions, 1957 flow [2021-10-28 09:45:29,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:29,877 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:29,877 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:29,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:45:29,878 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 770523369, now seen corresponding path program 2 times [2021-10-28 09:45:29,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:29,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278533261] [2021-10-28 09:45:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:29,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 09:45:29,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:29,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278533261] [2021-10-28 09:45:29,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278533261] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:45:29,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:45:29,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:45:29,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571771916] [2021-10-28 09:45:29,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:45:29,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:45:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:45:29,949 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 99 [2021-10-28 09:45:29,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 183 transitions, 1957 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:29,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:29,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 99 [2021-10-28 09:45:29,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:30,186 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([256] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][105], [Black: 188#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 518#(<= 2 ~pos~0), Black: 765#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork0_~lv_assert~0) (<= thread1Thread1of1ForFork0_~lv_assert~0 1) (<= 0 ~pos~0)), Black: 763#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 517#(<= 0 ~pos~0), Black: 136#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 198#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 130#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 126#true, 779#true, 174#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1))), Black: 208#(<= 0 ~pos~0), 94#L92true, Black: 781#(= (* 256 (div ~d1~0 256)) ~d1~0), Black: 452#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 782#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 450#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))), Black: 456#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= thread2Thread1of1ForFork1_~lv_assert~1 1) (<= 0 ~pos~0)), 194#true, 7#L59true, 204#true, 132#(<= (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) 1) thread1Thread1of1ForFork0_~lv_assert~0), Black: 470#true, 37#L83true, Black: 479#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 472#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 481#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0)), Black: 476#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L111-4true, 761#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 170#(and (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 493#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 172#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 495#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 790#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 164#(= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1), Black: 492#(and (= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), 474#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 165#(<= (+ thread1Thread1of1ForFork0_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork0_~lv_assert~0 256)) thread2Thread1of1ForFork1_~lv_assert~1)), Black: 491#(= ~v_assert~0 thread1Thread1of1ForFork0_~lv_assert~0), Black: 168#(and (<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1)), Black: 166#(<= (+ (* 256 (div thread2Thread1of1ForFork1_~lv_assert~1 256)) 1) thread2Thread1of1ForFork1_~lv_assert~1), Black: 115#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 109#(<= 0 ~pos~0), Black: 117#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork1_~lv_assert~1 256) 0) (<= 1 thread2Thread1of1ForFork1_~lv_assert~1) (<= 0 ~pos~0)), 184#true, Black: 507#(and (= ~v_assert~0 thread2Thread1of1ForFork1_~lv_assert~1) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256))))]) [2021-10-28 09:45:30,187 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2021-10-28 09:45:30,187 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:30,187 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:30,187 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2021-10-28 09:45:30,699 INFO L129 PetriNetUnfolder]: 766/3058 cut-off events. [2021-10-28 09:45:30,699 INFO L130 PetriNetUnfolder]: For 30613/31151 co-relation queries the response was YES. [2021-10-28 09:45:30,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15868 conditions, 3058 events. 766/3058 cut-off events. For 30613/31151 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 27785 event pairs, 179 based on Foata normal form. 143/3064 useless extension candidates. Maximal degree in co-relation 15521. Up to 546 conditions per place. [2021-10-28 09:45:30,757 INFO L132 encePairwiseOnDemand]: 94/99 looper letters, 6 selfloop transitions, 5 changer transitions 1/173 dead transitions. [2021-10-28 09:45:30,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 173 transitions, 1720 flow [2021-10-28 09:45:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:45:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-28 09:45:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions. [2021-10-28 09:45:30,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2021-10-28 09:45:30,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 368 transitions. [2021-10-28 09:45:30,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 368 transitions. [2021-10-28 09:45:30,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:30,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 368 transitions. [2021-10-28 09:45:30,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:30,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:30,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:30,764 INFO L186 Difference]: Start difference. First operand has 167 places, 183 transitions, 1957 flow. Second operand 4 states and 368 transitions. [2021-10-28 09:45:30,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 173 transitions, 1720 flow [2021-10-28 09:45:30,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 173 transitions, 1674 flow, removed 18 selfloop flow, removed 2 redundant places. [2021-10-28 09:45:30,820 INFO L242 Difference]: Finished difference. Result has 171 places, 171 transitions, 1662 flow [2021-10-28 09:45:30,820 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1662, PETRI_PLACES=171, PETRI_TRANSITIONS=171} [2021-10-28 09:45:30,821 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 82 predicate places. [2021-10-28 09:45:30,821 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 171 transitions, 1662 flow [2021-10-28 09:45:30,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:30,821 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:30,822 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:30,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:45:30,824 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash -278656628, now seen corresponding path program 1 times [2021-10-28 09:45:30,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:30,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061925109] [2021-10-28 09:45:30,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:30,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:31,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:31,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061925109] [2021-10-28 09:45:31,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061925109] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:31,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546670967] [2021-10-28 09:45:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:31,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:45:31,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:45:31,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:45:31,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 09:45:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:31,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 09:45:31,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:45:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:31,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546670967] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:31,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:45:31,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-10-28 09:45:31,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058373081] [2021-10-28 09:45:31,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:45:31,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:45:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:45:31,669 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 99 [2021-10-28 09:45:31,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 171 transitions, 1662 flow. Second operand has 14 states, 14 states have (on average 67.28571428571429) internal successors, (942), 14 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:31,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:31,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 99 [2021-10-28 09:45:31,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:35,241 INFO L129 PetriNetUnfolder]: 5856/13545 cut-off events. [2021-10-28 09:45:35,241 INFO L130 PetriNetUnfolder]: For 172072/174271 co-relation queries the response was YES. [2021-10-28 09:45:35,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81452 conditions, 13545 events. 5856/13545 cut-off events. For 172072/174271 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 127379 event pairs, 1143 based on Foata normal form. 171/13615 useless extension candidates. Maximal degree in co-relation 81123. Up to 1969 conditions per place. [2021-10-28 09:45:35,464 INFO L132 encePairwiseOnDemand]: 87/99 looper letters, 144 selfloop transitions, 58 changer transitions 202/467 dead transitions. [2021-10-28 09:45:35,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 467 transitions, 6064 flow [2021-10-28 09:45:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:45:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-28 09:45:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1270 transitions. [2021-10-28 09:45:35,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7546048722519311 [2021-10-28 09:45:35,470 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1270 transitions. [2021-10-28 09:45:35,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1270 transitions. [2021-10-28 09:45:35,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:35,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1270 transitions. [2021-10-28 09:45:35,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 74.70588235294117) internal successors, (1270), 17 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:35,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 99.0) internal successors, (1782), 18 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:35,482 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 99.0) internal successors, (1782), 18 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:35,482 INFO L186 Difference]: Start difference. First operand has 171 places, 171 transitions, 1662 flow. Second operand 17 states and 1270 transitions. [2021-10-28 09:45:35,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 467 transitions, 6064 flow [2021-10-28 09:45:35,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 467 transitions, 6064 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-28 09:45:35,728 INFO L242 Difference]: Finished difference. Result has 198 places, 184 transitions, 2058 flow [2021-10-28 09:45:35,728 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2058, PETRI_PLACES=198, PETRI_TRANSITIONS=184} [2021-10-28 09:45:35,729 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 109 predicate places. [2021-10-28 09:45:35,729 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 184 transitions, 2058 flow [2021-10-28 09:45:35,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 67.28571428571429) internal successors, (942), 14 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:35,730 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:35,730 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:35,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-10-28 09:45:35,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-28 09:45:35,935 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:35,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:35,936 INFO L85 PathProgramCache]: Analyzing trace with hash -948901734, now seen corresponding path program 2 times [2021-10-28 09:45:35,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:35,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958185663] [2021-10-28 09:45:35,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:35,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:36,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:36,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958185663] [2021-10-28 09:45:36,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958185663] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:36,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293075611] [2021-10-28 09:45:36,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-28 09:45:36,179 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:45:36,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:45:36,181 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:45:36,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-28 09:45:36,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-28 09:45:36,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:45:36,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 09:45:36,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:45:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:36,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293075611] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:36,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:45:36,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-10-28 09:45:36,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703777736] [2021-10-28 09:45:36,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:45:36,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:45:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:45:36,833 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 99 [2021-10-28 09:45:36,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 184 transitions, 2058 flow. Second operand has 14 states, 14 states have (on average 64.71428571428571) internal successors, (906), 14 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:36,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:36,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 99 [2021-10-28 09:45:36,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:40,700 INFO L129 PetriNetUnfolder]: 5841/12644 cut-off events. [2021-10-28 09:45:40,700 INFO L130 PetriNetUnfolder]: For 197037/198728 co-relation queries the response was YES. [2021-10-28 09:45:40,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83523 conditions, 12644 events. 5841/12644 cut-off events. For 197037/198728 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 109871 event pairs, 1548 based on Foata normal form. 129/12770 useless extension candidates. Maximal degree in co-relation 82215. Up to 3447 conditions per place. [2021-10-28 09:45:40,953 INFO L132 encePairwiseOnDemand]: 85/99 looper letters, 187 selfloop transitions, 67 changer transitions 231/534 dead transitions. [2021-10-28 09:45:40,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 534 transitions, 7632 flow [2021-10-28 09:45:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-28 09:45:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-28 09:45:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1778 transitions. [2021-10-28 09:45:40,958 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7183838383838383 [2021-10-28 09:45:40,958 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1778 transitions. [2021-10-28 09:45:40,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1778 transitions. [2021-10-28 09:45:40,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:40,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1778 transitions. [2021-10-28 09:45:40,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 71.12) internal successors, (1778), 25 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:40,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 99.0) internal successors, (2574), 26 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:40,973 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 99.0) internal successors, (2574), 26 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:40,973 INFO L186 Difference]: Start difference. First operand has 198 places, 184 transitions, 2058 flow. Second operand 25 states and 1778 transitions. [2021-10-28 09:45:40,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 534 transitions, 7632 flow [2021-10-28 09:45:41,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 534 transitions, 7301 flow, removed 136 selfloop flow, removed 9 redundant places. [2021-10-28 09:45:41,524 INFO L242 Difference]: Finished difference. Result has 228 places, 211 transitions, 2619 flow [2021-10-28 09:45:41,525 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2619, PETRI_PLACES=228, PETRI_TRANSITIONS=211} [2021-10-28 09:45:41,525 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 139 predicate places. [2021-10-28 09:45:41,526 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 211 transitions, 2619 flow [2021-10-28 09:45:41,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.71428571428571) internal successors, (906), 14 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:41,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:45:41,527 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:45:41,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-28 09:45:41,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-28 09:45:41,740 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-28 09:45:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:45:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1495337372, now seen corresponding path program 3 times [2021-10-28 09:45:41,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:45:41,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242439899] [2021-10-28 09:45:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:45:41,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:45:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:45:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:41,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:45:41,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242439899] [2021-10-28 09:45:41,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242439899] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:41,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541777127] [2021-10-28 09:45:41,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-28 09:45:41,956 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:45:41,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:45:41,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:45:41,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-28 09:45:42,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-28 09:45:42,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:45:42,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 09:45:42,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:45:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:45:42,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541777127] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:45:42,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:45:42,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-10-28 09:45:42,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170906492] [2021-10-28 09:45:42,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:45:42,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:45:42,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:45:42,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:45:42,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 99 [2021-10-28 09:45:42,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 211 transitions, 2619 flow. Second operand has 15 states, 15 states have (on average 64.46666666666667) internal successors, (967), 15 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:42,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:45:42,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 99 [2021-10-28 09:45:42,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:45:46,348 INFO L129 PetriNetUnfolder]: 5522/10946 cut-off events. [2021-10-28 09:45:46,349 INFO L130 PetriNetUnfolder]: For 188052/188052 co-relation queries the response was YES. [2021-10-28 09:45:46,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76088 conditions, 10946 events. 5522/10946 cut-off events. For 188052/188052 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 83044 event pairs, 1183 based on Foata normal form. 56/10999 useless extension candidates. Maximal degree in co-relation 76012. Up to 4220 conditions per place. [2021-10-28 09:45:46,553 INFO L132 encePairwiseOnDemand]: 85/99 looper letters, 0 selfloop transitions, 0 changer transitions 474/474 dead transitions. [2021-10-28 09:45:46,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 474 transitions, 7359 flow [2021-10-28 09:45:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-28 09:45:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-28 09:45:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1812 transitions. [2021-10-28 09:45:46,559 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.703962703962704 [2021-10-28 09:45:46,560 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1812 transitions. [2021-10-28 09:45:46,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1812 transitions. [2021-10-28 09:45:46,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:45:46,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1812 transitions. [2021-10-28 09:45:46,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 69.6923076923077) internal successors, (1812), 26 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:46,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 99.0) internal successors, (2673), 27 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:46,571 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 99.0) internal successors, (2673), 27 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:46,572 INFO L186 Difference]: Start difference. First operand has 228 places, 211 transitions, 2619 flow. Second operand 26 states and 1812 transitions. [2021-10-28 09:45:46,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 474 transitions, 7359 flow [2021-10-28 09:45:47,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 474 transitions, 6545 flow, removed 379 selfloop flow, removed 27 redundant places. [2021-10-28 09:45:47,077 INFO L242 Difference]: Finished difference. Result has 187 places, 0 transitions, 0 flow [2021-10-28 09:45:47,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=0, PETRI_PLACES=187, PETRI_TRANSITIONS=0} [2021-10-28 09:45:47,077 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, 98 predicate places. [2021-10-28 09:45:47,077 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 0 transitions, 0 flow [2021-10-28 09:45:47,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 64.46666666666667) internal successors, (967), 15 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:45:47,081 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:45:47,082 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 09:45:47,082 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 09:45:47,082 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 09:45:47,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-10-28 09:45:47,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-28 09:45:47,299 INFO L731 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 1] [2021-10-28 09:45:47,302 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 09:45:47,302 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:45:47,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:45:47 BasicIcfg [2021-10-28 09:45:47,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:45:47,306 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:45:47,306 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:45:47,306 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:45:47,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:45:14" (3/4) ... [2021-10-28 09:45:47,310 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:45:47,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-28 09:45:47,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-28 09:45:47,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-28 09:45:47,323 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-10-28 09:45:47,331 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 09:45:47,331 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:45:47,331 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:45:47,388 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:45:47,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:45:47,391 INFO L168 Benchmark]: Toolchain (without parser) took 33658.53 ms. Allocated memory was 96.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 61.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,391 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 96.5 MB. Free memory was 67.0 MB in the beginning and 66.9 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:45:47,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.28 ms. Allocated memory is still 96.5 MB. Free memory was 61.1 MB in the beginning and 71.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.76 ms. Allocated memory is still 96.5 MB. Free memory was 71.8 MB in the beginning and 70.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,393 INFO L168 Benchmark]: Boogie Preprocessor took 28.89 ms. Allocated memory is still 96.5 MB. Free memory was 70.4 MB in the beginning and 68.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,394 INFO L168 Benchmark]: RCFGBuilder took 438.70 ms. Allocated memory is still 96.5 MB. Free memory was 68.8 MB in the beginning and 55.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,394 INFO L168 Benchmark]: TraceAbstraction took 32767.03 ms. Allocated memory was 96.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 55.2 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,395 INFO L168 Benchmark]: Witness Printer took 83.20 ms. Allocated memory is still 3.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:45:47,398 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.29 ms. Allocated memory is still 96.5 MB. Free memory was 67.0 MB in the beginning and 66.9 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 296.28 ms. Allocated memory is still 96.5 MB. Free memory was 61.1 MB in the beginning and 71.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.76 ms. Allocated memory is still 96.5 MB. Free memory was 71.8 MB in the beginning and 70.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.89 ms. Allocated memory is still 96.5 MB. Free memory was 70.4 MB in the beginning and 68.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 438.70 ms. Allocated memory is still 96.5 MB. Free memory was 68.8 MB in the beginning and 55.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32767.03 ms. Allocated memory was 96.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 55.2 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.1 GB. * Witness Printer took 83.20 ms. Allocated memory is still 3.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 120 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.6s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 427 SDtfs, 719 SDslu, 1864 SDs, 0 SdLazy, 3359 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 433 SyntacticMatches, 5 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2619occurred in iteration=15, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1663 NumberOfCodeBlocks, 1663 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 5688 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1006 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 91/149 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-28 09:45:47,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d65802a0-5bce-4946-b224-0e3c09bedc1a/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...