./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/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_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/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_5ea5e9b2-beaa-459a-b375-b0579fa784b7/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 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:38:28,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:38:28,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:38:28,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:38:28,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:38:28,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:38:28,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:38:28,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:38:28,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:38:28,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:38:28,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:38:28,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:38:28,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:38:28,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:38:28,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:38:28,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:38:28,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:38:28,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:38:28,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:38:28,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:38:28,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:38:28,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:38:28,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:38:28,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:38:28,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:38:28,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:38:28,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:38:28,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:38:28,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:38:28,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:38:28,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:38:28,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:38:28,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:38:28,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:38:28,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:38:28,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:38:28,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:38:28,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:38:28,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:38:28,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:38:28,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:38:28,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:38:28,593 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:38:28,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:38:28,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:38:28,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:38:28,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:38:28,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:38:28,603 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:38:28,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:38:28,603 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:38:28,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:38:28,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:38:28,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:38:28,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:38:28,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:38:28,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:38:28,606 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:38:28,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:38:28,606 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:38:28,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:38:28,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:38:28,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:38:28,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:38:28,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:38:28,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:38:28,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:38:28,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:38:28,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:38:28,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:38:28,609 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:38:28,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:38:28,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:38:28,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:38:28,612 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_5ea5e9b2-beaa-459a-b375-b0579fa784b7/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_5ea5e9b2-beaa-459a-b375-b0579fa784b7/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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2021-10-28 09:38:28,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:38:28,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:38:28,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:38:28,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:38:28,932 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:38:28,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2021-10-28 09:38:29,015 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/data/bb6e9ba43/31cca40e0a234da1b1ae11c8b4992fcf/FLAGc44f67316 [2021-10-28 09:38:29,580 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:38:29,580 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2021-10-28 09:38:29,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/data/bb6e9ba43/31cca40e0a234da1b1ae11c8b4992fcf/FLAGc44f67316 [2021-10-28 09:38:29,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/data/bb6e9ba43/31cca40e0a234da1b1ae11c8b4992fcf [2021-10-28 09:38:29,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:38:29,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:38:29,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:38:29,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:38:29,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:38:29,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:38:29" (1/1) ... [2021-10-28 09:38:29,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bcc183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:29, skipping insertion in model container [2021-10-28 09:38:29,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:38:29" (1/1) ... [2021-10-28 09:38:29,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:38:30,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:38:30,245 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_5ea5e9b2-beaa-459a-b375-b0579fa784b7/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2021-10-28 09:38:30,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:38:30,571 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:38:30,583 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_5ea5e9b2-beaa-459a-b375-b0579fa784b7/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2021-10-28 09:38:30,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:38:30,692 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:38:30,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30 WrapperNode [2021-10-28 09:38:30,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:38:30,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:38:30,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:38:30,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:38:30,702 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:38:30" (1/1) ... [2021-10-28 09:38:30,721 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:38:30" (1/1) ... [2021-10-28 09:38:30,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:38:30,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:38:30,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:38:30,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:38:30,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:38:30,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:38:30,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:38:30,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:38:30,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (1/1) ... [2021-10-28 09:38:30,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:38:30,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:38:30,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:38:30,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:38:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:38:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 09:38:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:38:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:38:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 09:38:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 09:38:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 09:38:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 09:38:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 09:38:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 09:38:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-28 09:38:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-28 09:38:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:38:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 09:38:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:38:30,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:38:30,948 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:38:33,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:38:33,344 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 09:38:33,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:38:33 BoogieIcfgContainer [2021-10-28 09:38:33,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:38:33,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:38:33,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:38:33,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:38:33,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:38:29" (1/3) ... [2021-10-28 09:38:33,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42ffac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:38:33, skipping insertion in model container [2021-10-28 09:38:33,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:38:30" (2/3) ... [2021-10-28 09:38:33,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d42ffac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:38:33, skipping insertion in model container [2021-10-28 09:38:33,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:38:33" (3/3) ... [2021-10-28 09:38:33,362 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2021-10-28 09:38:33,368 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 09:38:33,368 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:38:33,369 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:38:33,369 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 09:38:33,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,437 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,449 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,450 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,468 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,468 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,468 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,472 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,481 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,483 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:38:33,485 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 09:38:33,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:38:33,559 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:38:33,560 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-28 09:38:33,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2021-10-28 09:38:33,634 INFO L129 PetriNetUnfolder]: 2/127 cut-off events. [2021-10-28 09:38:33,635 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:38:33,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2021-10-28 09:38:33,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2021-10-28 09:38:33,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2021-10-28 09:38:33,658 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2021-10-28 09:38:33,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:38:33,659 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:33,659 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] [2021-10-28 09:38:33,660 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -133044646, now seen corresponding path program 1 times [2021-10-28 09:38:33,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:33,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977475938] [2021-10-28 09:38:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:33,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:34,056 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:38:34,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:34,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977475938] [2021-10-28 09:38:34,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977475938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:34,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:34,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:38:34,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231644929] [2021-10-28 09:38:34,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:38:34,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:38:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:38:34,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 131 [2021-10-28 09:38:34,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:38:34,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:34,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 131 [2021-10-28 09:38:34,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:34,408 INFO L129 PetriNetUnfolder]: 133/564 cut-off events. [2021-10-28 09:38:34,408 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:38:34,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 564 events. 133/564 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3047 event pairs, 29 based on Foata normal form. 29/558 useless extension candidates. Maximal degree in co-relation 729. Up to 153 conditions per place. [2021-10-28 09:38:34,423 INFO L132 encePairwiseOnDemand]: 126/131 looper letters, 11 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2021-10-28 09:38:34,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 128 transitions, 294 flow [2021-10-28 09:38:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:38:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 09:38:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-10-28 09:38:34,445 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2021-10-28 09:38:34,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-10-28 09:38:34,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-10-28 09:38:34,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:34,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-10-28 09:38:34,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:38:34,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:38:34,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:38:34,498 INFO L186 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 3 states and 375 transitions. [2021-10-28 09:38:34,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 128 transitions, 294 flow [2021-10-28 09:38:34,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 128 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-10-28 09:38:34,510 INFO L242 Difference]: Finished difference. Result has 134 places, 123 transitions, 258 flow [2021-10-28 09:38:34,515 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2021-10-28 09:38:34,516 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, -4 predicate places. [2021-10-28 09:38:34,517 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 258 flow [2021-10-28 09:38:34,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:38:34,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:34,518 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:34,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:38:34,518 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1970977051, now seen corresponding path program 1 times [2021-10-28 09:38:34,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:34,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488067504] [2021-10-28 09:38:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:34,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:34,829 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:38:34,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:34,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488067504] [2021-10-28 09:38:34,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488067504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:34,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:34,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:38:34,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216186063] [2021-10-28 09:38:34,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:38:34,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:34,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:38:34,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:38:34,837 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 131 [2021-10-28 09:38:34,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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:38:34,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:34,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 131 [2021-10-28 09:38:34,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:35,093 INFO L129 PetriNetUnfolder]: 30/322 cut-off events. [2021-10-28 09:38:35,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:38:35,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 322 events. 30/322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1320 event pairs, 6 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 364. Up to 36 conditions per place. [2021-10-28 09:38:35,102 INFO L132 encePairwiseOnDemand]: 124/131 looper letters, 8 selfloop transitions, 3 changer transitions 33/146 dead transitions. [2021-10-28 09:38:35,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 146 transitions, 370 flow [2021-10-28 09:38:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:38:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:38:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2021-10-28 09:38:35,108 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9304495335029687 [2021-10-28 09:38:35,108 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2021-10-28 09:38:35,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2021-10-28 09:38:35,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:35,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2021-10-28 09:38:35,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states 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:38:35,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states 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:38:35,122 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states 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:38:35,122 INFO L186 Difference]: Start difference. First operand has 134 places, 123 transitions, 258 flow. Second operand 9 states and 1097 transitions. [2021-10-28 09:38:35,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 146 transitions, 370 flow [2021-10-28 09:38:35,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 146 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:38:35,130 INFO L242 Difference]: Finished difference. Result has 147 places, 113 transitions, 273 flow [2021-10-28 09:38:35,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=147, PETRI_TRANSITIONS=113} [2021-10-28 09:38:35,131 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2021-10-28 09:38:35,131 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 113 transitions, 273 flow [2021-10-28 09:38:35,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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:38:35,132 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:35,133 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:35,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:38:35,133 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:35,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash -653994628, now seen corresponding path program 1 times [2021-10-28 09:38:35,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:35,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640800458] [2021-10-28 09:38:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:35,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:35,610 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:38:35,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:35,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640800458] [2021-10-28 09:38:35,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640800458] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:35,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:35,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:38:35,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892129303] [2021-10-28 09:38:35,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:38:35,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:38:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:38:35,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 131 [2021-10-28 09:38:35,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 113 transitions, 273 flow. Second operand has 10 states, 10 states have (on average 110.1) internal successors, (1101), 10 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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:38:35,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:35,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 131 [2021-10-28 09:38:35,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:36,804 INFO L129 PetriNetUnfolder]: 1475/2943 cut-off events. [2021-10-28 09:38:36,805 INFO L130 PetriNetUnfolder]: For 1983/1997 co-relation queries the response was YES. [2021-10-28 09:38:36,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6528 conditions, 2943 events. 1475/2943 cut-off events. For 1983/1997 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 22105 event pairs, 752 based on Foata normal form. 72/2860 useless extension candidates. Maximal degree in co-relation 6465. Up to 1206 conditions per place. [2021-10-28 09:38:36,846 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 15 selfloop transitions, 12 changer transitions 53/176 dead transitions. [2021-10-28 09:38:36,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 176 transitions, 587 flow [2021-10-28 09:38:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:38:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:38:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1718 transitions. [2021-10-28 09:38:36,853 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8743002544529263 [2021-10-28 09:38:36,853 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1718 transitions. [2021-10-28 09:38:36,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1718 transitions. [2021-10-28 09:38:36,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:36,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1718 transitions. [2021-10-28 09:38:36,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.53333333333333) internal successors, (1718), 15 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states 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:38:36,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:38:36,868 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:38:36,869 INFO L186 Difference]: Start difference. First operand has 147 places, 113 transitions, 273 flow. Second operand 15 states and 1718 transitions. [2021-10-28 09:38:36,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 176 transitions, 587 flow [2021-10-28 09:38:36,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 176 transitions, 566 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-10-28 09:38:36,892 INFO L242 Difference]: Finished difference. Result has 150 places, 121 transitions, 360 flow [2021-10-28 09:38:36,892 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=360, PETRI_PLACES=150, PETRI_TRANSITIONS=121} [2021-10-28 09:38:36,893 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 12 predicate places. [2021-10-28 09:38:36,893 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 121 transitions, 360 flow [2021-10-28 09:38:36,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.1) internal successors, (1101), 10 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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:38:36,894 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:36,894 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:36,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:38:36,895 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -776303515, now seen corresponding path program 1 times [2021-10-28 09:38:36,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:36,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706545737] [2021-10-28 09:38:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:36,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:37,099 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:38:37,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:37,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706545737] [2021-10-28 09:38:37,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706545737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:37,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:37,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:38:37,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404656733] [2021-10-28 09:38:37,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:38:37,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:37,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:38:37,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:38:37,105 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 131 [2021-10-28 09:38:37,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 121 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states 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:38:37,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:37,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 131 [2021-10-28 09:38:37,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:37,430 INFO L129 PetriNetUnfolder]: 216/872 cut-off events. [2021-10-28 09:38:37,430 INFO L130 PetriNetUnfolder]: For 2118/2199 co-relation queries the response was YES. [2021-10-28 09:38:37,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 872 events. 216/872 cut-off events. For 2118/2199 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6288 event pairs, 93 based on Foata normal form. 29/835 useless extension candidates. Maximal degree in co-relation 2283. Up to 116 conditions per place. [2021-10-28 09:38:37,448 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 8 selfloop transitions, 10 changer transitions 0/131 dead transitions. [2021-10-28 09:38:37,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 131 transitions, 454 flow [2021-10-28 09:38:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:38:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:38:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2021-10-28 09:38:37,453 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9253604749787956 [2021-10-28 09:38:37,453 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2021-10-28 09:38:37,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2021-10-28 09:38:37,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:37,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2021-10-28 09:38:37,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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:38:37,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states 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:38:37,462 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states 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:38:37,462 INFO L186 Difference]: Start difference. First operand has 150 places, 121 transitions, 360 flow. Second operand 9 states and 1091 transitions. [2021-10-28 09:38:37,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 131 transitions, 454 flow [2021-10-28 09:38:37,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 131 transitions, 434 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-10-28 09:38:37,471 INFO L242 Difference]: Finished difference. Result has 147 places, 129 transitions, 431 flow [2021-10-28 09:38:37,472 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=431, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2021-10-28 09:38:37,472 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2021-10-28 09:38:37,472 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 431 flow [2021-10-28 09:38:37,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states 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:38:37,473 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:37,473 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:37,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:38:37,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1189543362, now seen corresponding path program 1 times [2021-10-28 09:38:37,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:37,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850025892] [2021-10-28 09:38:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:37,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:37,886 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:38:37,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:37,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850025892] [2021-10-28 09:38:37,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850025892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:37,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:37,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:38:37,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933060589] [2021-10-28 09:38:37,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:38:37,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:38:37,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:38:37,891 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 131 [2021-10-28 09:38:37,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 431 flow. Second operand has 13 states, 13 states have (on average 108.07692307692308) internal successors, (1405), 13 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:38:37,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:37,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 131 [2021-10-28 09:38:37,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:39,081 INFO L129 PetriNetUnfolder]: 1452/2935 cut-off events. [2021-10-28 09:38:39,082 INFO L130 PetriNetUnfolder]: For 8901/9144 co-relation queries the response was YES. [2021-10-28 09:38:39,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9882 conditions, 2935 events. 1452/2935 cut-off events. For 8901/9144 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 21607 event pairs, 936 based on Foata normal form. 47/2874 useless extension candidates. Maximal degree in co-relation 9804. Up to 1691 conditions per place. [2021-10-28 09:38:39,199 INFO L132 encePairwiseOnDemand]: 117/131 looper letters, 17 selfloop transitions, 18 changer transitions 52/181 dead transitions. [2021-10-28 09:38:39,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 181 transitions, 923 flow [2021-10-28 09:38:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:38:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-28 09:38:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1895 transitions. [2021-10-28 09:38:39,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8509205208801077 [2021-10-28 09:38:39,208 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1895 transitions. [2021-10-28 09:38:39,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1895 transitions. [2021-10-28 09:38:39,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:39,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1895 transitions. [2021-10-28 09:38:39,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 111.47058823529412) internal successors, (1895), 17 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states 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:38:39,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 131.0) internal successors, (2358), 18 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states 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:38:39,230 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 131.0) internal successors, (2358), 18 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states 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:38:39,230 INFO L186 Difference]: Start difference. First operand has 147 places, 129 transitions, 431 flow. Second operand 17 states and 1895 transitions. [2021-10-28 09:38:39,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 181 transitions, 923 flow [2021-10-28 09:38:39,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 181 transitions, 923 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-28 09:38:39,265 INFO L242 Difference]: Finished difference. Result has 174 places, 127 transitions, 495 flow [2021-10-28 09:38:39,265 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=495, PETRI_PLACES=174, PETRI_TRANSITIONS=127} [2021-10-28 09:38:39,266 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 36 predicate places. [2021-10-28 09:38:39,266 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 127 transitions, 495 flow [2021-10-28 09:38:39,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.07692307692308) internal successors, (1405), 13 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:38:39,267 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:39,267 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:39,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:38:39,268 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash 749677143, now seen corresponding path program 1 times [2021-10-28 09:38:39,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:39,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603151620] [2021-10-28 09:38:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:39,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:39,527 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:38:39,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:39,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603151620] [2021-10-28 09:38:39,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603151620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:39,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:39,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:38:39,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502541478] [2021-10-28 09:38:39,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:38:39,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:38:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:38:39,532 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 131 [2021-10-28 09:38:39,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 127 transitions, 495 flow. Second operand has 10 states, 10 states have (on average 110.2) internal successors, (1102), 10 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states 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:38:39,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:39,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 131 [2021-10-28 09:38:39,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:40,608 INFO L129 PetriNetUnfolder]: 993/2104 cut-off events. [2021-10-28 09:38:40,608 INFO L130 PetriNetUnfolder]: For 17342/17627 co-relation queries the response was YES. [2021-10-28 09:38:40,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 2104 events. 993/2104 cut-off events. For 17342/17627 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14389 event pairs, 166 based on Foata normal form. 61/2109 useless extension candidates. Maximal degree in co-relation 8894. Up to 729 conditions per place. [2021-10-28 09:38:40,654 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 37 selfloop transitions, 13 changer transitions 46/192 dead transitions. [2021-10-28 09:38:40,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 192 transitions, 1243 flow [2021-10-28 09:38:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:38:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:38:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1720 transitions. [2021-10-28 09:38:40,661 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8753180661577609 [2021-10-28 09:38:40,661 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1720 transitions. [2021-10-28 09:38:40,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1720 transitions. [2021-10-28 09:38:40,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:40,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1720 transitions. [2021-10-28 09:38:40,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.66666666666667) internal successors, (1720), 15 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states 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:38:40,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:38:40,676 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:38:40,676 INFO L186 Difference]: Start difference. First operand has 174 places, 127 transitions, 495 flow. Second operand 15 states and 1720 transitions. [2021-10-28 09:38:40,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 192 transitions, 1243 flow [2021-10-28 09:38:40,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 192 transitions, 995 flow, removed 118 selfloop flow, removed 17 redundant places. [2021-10-28 09:38:40,699 INFO L242 Difference]: Finished difference. Result has 167 places, 132 transitions, 542 flow [2021-10-28 09:38:40,699 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=542, PETRI_PLACES=167, PETRI_TRANSITIONS=132} [2021-10-28 09:38:40,700 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 29 predicate places. [2021-10-28 09:38:40,700 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 132 transitions, 542 flow [2021-10-28 09:38:40,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.2) internal successors, (1102), 10 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states 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:38:40,701 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:40,701 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:40,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:38:40,701 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1882463301, now seen corresponding path program 1 times [2021-10-28 09:38:40,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:40,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128081526] [2021-10-28 09:38:40,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:40,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:41,065 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:38:41,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:41,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128081526] [2021-10-28 09:38:41,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128081526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:41,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:41,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:38:41,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098441786] [2021-10-28 09:38:41,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:38:41,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:41,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:38:41,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:38:41,074 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2021-10-28 09:38:41,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 132 transitions, 542 flow. Second operand has 11 states, 11 states have (on average 109.27272727272727) internal successors, (1202), 11 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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:38:41,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:41,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2021-10-28 09:38:41,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:42,321 INFO L129 PetriNetUnfolder]: 1150/2457 cut-off events. [2021-10-28 09:38:42,321 INFO L130 PetriNetUnfolder]: For 17852/19922 co-relation queries the response was YES. [2021-10-28 09:38:42,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12165 conditions, 2457 events. 1150/2457 cut-off events. For 17852/19922 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17404 event pairs, 129 based on Foata normal form. 92/2479 useless extension candidates. Maximal degree in co-relation 12071. Up to 796 conditions per place. [2021-10-28 09:38:42,381 INFO L132 encePairwiseOnDemand]: 117/131 looper letters, 40 selfloop transitions, 23 changer transitions 56/214 dead transitions. [2021-10-28 09:38:42,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 214 transitions, 1725 flow [2021-10-28 09:38:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-28 09:38:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-28 09:38:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2266 transitions. [2021-10-28 09:38:42,389 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8648854961832061 [2021-10-28 09:38:42,389 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2266 transitions. [2021-10-28 09:38:42,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2266 transitions. [2021-10-28 09:38:42,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:42,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2266 transitions. [2021-10-28 09:38:42,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.3) internal successors, (2266), 20 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states 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:38:42,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 131.0) internal successors, (2751), 21 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states 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:38:42,406 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 131.0) internal successors, (2751), 21 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states 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:38:42,406 INFO L186 Difference]: Start difference. First operand has 167 places, 132 transitions, 542 flow. Second operand 20 states and 2266 transitions. [2021-10-28 09:38:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 214 transitions, 1725 flow [2021-10-28 09:38:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 214 transitions, 1621 flow, removed 44 selfloop flow, removed 9 redundant places. [2021-10-28 09:38:42,443 INFO L242 Difference]: Finished difference. Result has 182 places, 139 transitions, 739 flow [2021-10-28 09:38:42,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=739, PETRI_PLACES=182, PETRI_TRANSITIONS=139} [2021-10-28 09:38:42,443 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 44 predicate places. [2021-10-28 09:38:42,444 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 139 transitions, 739 flow [2021-10-28 09:38:42,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.27272727272727) internal successors, (1202), 11 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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:38:42,445 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:42,445 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:42,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:38:42,445 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash -11438928, now seen corresponding path program 1 times [2021-10-28 09:38:42,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:42,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177326914] [2021-10-28 09:38:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:42,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:42,593 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:38:42,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:42,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177326914] [2021-10-28 09:38:42,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177326914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:42,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:42,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:38:42,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864244754] [2021-10-28 09:38:42,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:38:42,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:38:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:38:42,596 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 131 [2021-10-28 09:38:42,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 139 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:38:42,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:42,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 131 [2021-10-28 09:38:42,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:43,981 INFO L129 PetriNetUnfolder]: 2460/5319 cut-off events. [2021-10-28 09:38:43,981 INFO L130 PetriNetUnfolder]: For 45958/48613 co-relation queries the response was YES. [2021-10-28 09:38:44,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21313 conditions, 5319 events. 2460/5319 cut-off events. For 45958/48613 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 48777 event pairs, 257 based on Foata normal form. 65/4807 useless extension candidates. Maximal degree in co-relation 21213. Up to 1100 conditions per place. [2021-10-28 09:38:44,153 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 29 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2021-10-28 09:38:44,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 176 transitions, 911 flow [2021-10-28 09:38:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:38:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 09:38:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1211 transitions. [2021-10-28 09:38:44,159 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9244274809160306 [2021-10-28 09:38:44,159 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1211 transitions. [2021-10-28 09:38:44,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1211 transitions. [2021-10-28 09:38:44,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:44,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1211 transitions. [2021-10-28 09:38:44,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.1) internal successors, (1211), 10 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states 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:38:44,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states 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:38:44,169 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states 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:38:44,169 INFO L186 Difference]: Start difference. First operand has 182 places, 139 transitions, 739 flow. Second operand 10 states and 1211 transitions. [2021-10-28 09:38:44,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 176 transitions, 911 flow [2021-10-28 09:38:44,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 176 transitions, 852 flow, removed 27 selfloop flow, removed 12 redundant places. [2021-10-28 09:38:44,215 INFO L242 Difference]: Finished difference. Result has 173 places, 157 transitions, 823 flow [2021-10-28 09:38:44,215 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=823, PETRI_PLACES=173, PETRI_TRANSITIONS=157} [2021-10-28 09:38:44,216 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 35 predicate places. [2021-10-28 09:38:44,216 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 157 transitions, 823 flow [2021-10-28 09:38:44,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:38:44,217 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:44,217 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:44,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:38:44,217 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:44,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1023741381, now seen corresponding path program 1 times [2021-10-28 09:38:44,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:44,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885193201] [2021-10-28 09:38:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:44,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:44,356 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:38:44,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:44,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885193201] [2021-10-28 09:38:44,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885193201] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:44,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:44,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:38:44,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350940100] [2021-10-28 09:38:44,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:38:44,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:38:44,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:38:44,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 131 [2021-10-28 09:38:44,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 157 transitions, 823 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:38:44,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:44,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 131 [2021-10-28 09:38:44,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:45,592 INFO L129 PetriNetUnfolder]: 1881/4963 cut-off events. [2021-10-28 09:38:45,593 INFO L130 PetriNetUnfolder]: For 20668/28172 co-relation queries the response was YES. [2021-10-28 09:38:45,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18607 conditions, 4963 events. 1881/4963 cut-off events. For 20668/28172 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 50000 event pairs, 100 based on Foata normal form. 626/5155 useless extension candidates. Maximal degree in co-relation 18510. Up to 1641 conditions per place. [2021-10-28 09:38:45,848 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 34 selfloop transitions, 38 changer transitions 0/199 dead transitions. [2021-10-28 09:38:45,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 199 transitions, 1247 flow [2021-10-28 09:38:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:38:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 09:38:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1576 transitions. [2021-10-28 09:38:45,853 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9254257193188491 [2021-10-28 09:38:45,854 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1576 transitions. [2021-10-28 09:38:45,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1576 transitions. [2021-10-28 09:38:45,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:45,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1576 transitions. [2021-10-28 09:38:45,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states 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:38:45,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 131.0) internal successors, (1834), 14 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states 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:38:45,866 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 131.0) internal successors, (1834), 14 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states 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:38:45,866 INFO L186 Difference]: Start difference. First operand has 173 places, 157 transitions, 823 flow. Second operand 13 states and 1576 transitions. [2021-10-28 09:38:45,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 199 transitions, 1247 flow [2021-10-28 09:38:45,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 199 transitions, 1245 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-28 09:38:45,904 INFO L242 Difference]: Finished difference. Result has 190 places, 177 transitions, 1114 flow [2021-10-28 09:38:45,905 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1114, PETRI_PLACES=190, PETRI_TRANSITIONS=177} [2021-10-28 09:38:45,905 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 52 predicate places. [2021-10-28 09:38:45,905 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 177 transitions, 1114 flow [2021-10-28 09:38:45,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:38:45,906 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:45,906 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:45,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:38:45,907 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -526108428, now seen corresponding path program 1 times [2021-10-28 09:38:45,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:45,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67394109] [2021-10-28 09:38:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:45,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:46,150 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:38:46,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:46,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67394109] [2021-10-28 09:38:46,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67394109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:46,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:46,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:38:46,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156540768] [2021-10-28 09:38:46,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:38:46,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:38:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:38:46,154 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2021-10-28 09:38:46,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 177 transitions, 1114 flow. Second operand has 13 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:38:46,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:46,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2021-10-28 09:38:46,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:49,042 INFO L129 PetriNetUnfolder]: 3081/9715 cut-off events. [2021-10-28 09:38:49,042 INFO L130 PetriNetUnfolder]: For 61958/66394 co-relation queries the response was YES. [2021-10-28 09:38:49,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42162 conditions, 9715 events. 3081/9715 cut-off events. For 61958/66394 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 117763 event pairs, 320 based on Foata normal form. 221/9340 useless extension candidates. Maximal degree in co-relation 42052. Up to 2281 conditions per place. [2021-10-28 09:38:49,359 INFO L132 encePairwiseOnDemand]: 116/131 looper letters, 134 selfloop transitions, 81 changer transitions 16/361 dead transitions. [2021-10-28 09:38:49,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 361 transitions, 3885 flow [2021-10-28 09:38:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-28 09:38:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-10-28 09:38:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2675 transitions. [2021-10-28 09:38:49,373 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8508269720101781 [2021-10-28 09:38:49,373 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2675 transitions. [2021-10-28 09:38:49,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2675 transitions. [2021-10-28 09:38:49,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:49,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2675 transitions. [2021-10-28 09:38:49,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 111.45833333333333) internal successors, (2675), 24 states have internal predecessors, (2675), 0 states have call successors, (0), 0 states 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:38:49,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 131.0) internal successors, (3275), 25 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states 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:38:49,409 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 131.0) internal successors, (3275), 25 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states 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:38:49,409 INFO L186 Difference]: Start difference. First operand has 190 places, 177 transitions, 1114 flow. Second operand 24 states and 2675 transitions. [2021-10-28 09:38:49,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 361 transitions, 3885 flow [2021-10-28 09:38:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 361 transitions, 3790 flow, removed 38 selfloop flow, removed 4 redundant places. [2021-10-28 09:38:50,237 INFO L242 Difference]: Finished difference. Result has 226 places, 248 transitions, 2277 flow [2021-10-28 09:38:50,238 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2277, PETRI_PLACES=226, PETRI_TRANSITIONS=248} [2021-10-28 09:38:50,238 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 88 predicate places. [2021-10-28 09:38:50,239 INFO L470 AbstractCegarLoop]: Abstraction has has 226 places, 248 transitions, 2277 flow [2021-10-28 09:38:50,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:38:50,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:50,240 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:50,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:38:50,240 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1977790068, now seen corresponding path program 2 times [2021-10-28 09:38:50,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:50,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124919503] [2021-10-28 09:38:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:50,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:50,628 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:38:50,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:50,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124919503] [2021-10-28 09:38:50,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124919503] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:50,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:50,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:38:50,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591275125] [2021-10-28 09:38:50,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:38:50,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:50,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:38:50,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:38:50,632 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 131 [2021-10-28 09:38:50,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 248 transitions, 2277 flow. Second operand has 14 states, 14 states have (on average 108.14285714285714) internal successors, (1514), 14 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states 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:38:50,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:50,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 131 [2021-10-28 09:38:50,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:53,261 INFO L129 PetriNetUnfolder]: 3051/9847 cut-off events. [2021-10-28 09:38:53,261 INFO L130 PetriNetUnfolder]: For 88286/91998 co-relation queries the response was YES. [2021-10-28 09:38:53,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43385 conditions, 9847 events. 3051/9847 cut-off events. For 88286/91998 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 121625 event pairs, 319 based on Foata normal form. 234/9456 useless extension candidates. Maximal degree in co-relation 43256. Up to 1628 conditions per place. [2021-10-28 09:38:53,579 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 101 selfloop transitions, 65 changer transitions 9/312 dead transitions. [2021-10-28 09:38:53,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 312 transitions, 3856 flow [2021-10-28 09:38:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:38:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:38:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1680 transitions. [2021-10-28 09:38:53,588 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8549618320610687 [2021-10-28 09:38:53,589 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1680 transitions. [2021-10-28 09:38:53,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1680 transitions. [2021-10-28 09:38:53,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:53,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1680 transitions. [2021-10-28 09:38:53,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:38:53,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:38:53,598 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:38:53,598 INFO L186 Difference]: Start difference. First operand has 226 places, 248 transitions, 2277 flow. Second operand 15 states and 1680 transitions. [2021-10-28 09:38:53,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 312 transitions, 3856 flow [2021-10-28 09:38:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 312 transitions, 3507 flow, removed 173 selfloop flow, removed 2 redundant places. [2021-10-28 09:38:54,089 INFO L242 Difference]: Finished difference. Result has 246 places, 270 transitions, 2553 flow [2021-10-28 09:38:54,090 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2553, PETRI_PLACES=246, PETRI_TRANSITIONS=270} [2021-10-28 09:38:54,090 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 108 predicate places. [2021-10-28 09:38:54,090 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 270 transitions, 2553 flow [2021-10-28 09:38:54,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.14285714285714) internal successors, (1514), 14 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states 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:38:54,091 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:54,091 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:54,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:38:54,091 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash 680883055, now seen corresponding path program 1 times [2021-10-28 09:38:54,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:54,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825313027] [2021-10-28 09:38:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:54,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:54,247 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:38:54,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:54,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825313027] [2021-10-28 09:38:54,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825313027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:54,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:54,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:38:54,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095819782] [2021-10-28 09:38:54,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:38:54,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:38:54,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:38:54,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 131 [2021-10-28 09:38:54,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 270 transitions, 2553 flow. Second operand has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 0 states 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:38:54,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:54,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 131 [2021-10-28 09:38:54,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:38:57,275 INFO L129 PetriNetUnfolder]: 4216/11459 cut-off events. [2021-10-28 09:38:57,275 INFO L130 PetriNetUnfolder]: For 67172/88047 co-relation queries the response was YES. [2021-10-28 09:38:57,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46417 conditions, 11459 events. 4216/11459 cut-off events. For 67172/88047 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 140366 event pairs, 29 based on Foata normal form. 2520/12911 useless extension candidates. Maximal degree in co-relation 46281. Up to 2614 conditions per place. [2021-10-28 09:38:57,567 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 28 selfloop transitions, 58 changer transitions 34/288 dead transitions. [2021-10-28 09:38:57,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 288 transitions, 2855 flow [2021-10-28 09:38:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:38:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:38:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1941 transitions. [2021-10-28 09:38:57,573 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9260496183206107 [2021-10-28 09:38:57,573 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1941 transitions. [2021-10-28 09:38:57,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1941 transitions. [2021-10-28 09:38:57,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:38:57,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1941 transitions. [2021-10-28 09:38:57,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.3125) internal successors, (1941), 16 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states 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:38:57,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 131.0) internal successors, (2227), 17 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states 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:38:57,584 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 131.0) internal successors, (2227), 17 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states 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:38:57,584 INFO L186 Difference]: Start difference. First operand has 246 places, 270 transitions, 2553 flow. Second operand 16 states and 1941 transitions. [2021-10-28 09:38:57,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 288 transitions, 2855 flow [2021-10-28 09:38:58,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 288 transitions, 2557 flow, removed 127 selfloop flow, removed 13 redundant places. [2021-10-28 09:38:58,136 INFO L242 Difference]: Finished difference. Result has 246 places, 244 transitions, 2054 flow [2021-10-28 09:38:58,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2054, PETRI_PLACES=246, PETRI_TRANSITIONS=244} [2021-10-28 09:38:58,137 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 108 predicate places. [2021-10-28 09:38:58,137 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 244 transitions, 2054 flow [2021-10-28 09:38:58,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 0 states 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:38:58,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:38:58,137 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:38:58,137 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:38:58,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2128141950, now seen corresponding path program 1 times [2021-10-28 09:38:58,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:58,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41273581] [2021-10-28 09:38:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:58,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:58,416 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:38:58,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:58,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41273581] [2021-10-28 09:38:58,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41273581] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:58,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:58,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:38:58,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947714380] [2021-10-28 09:38:58,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:38:58,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:38:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:38:58,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 131 [2021-10-28 09:38:58,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 244 transitions, 2054 flow. Second operand has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:38:58,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:38:58,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 131 [2021-10-28 09:38:58,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:39:00,920 INFO L129 PetriNetUnfolder]: 3113/10503 cut-off events. [2021-10-28 09:39:00,920 INFO L130 PetriNetUnfolder]: For 60242/62966 co-relation queries the response was YES. [2021-10-28 09:39:01,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41909 conditions, 10503 events. 3113/10503 cut-off events. For 60242/62966 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 137225 event pairs, 30 based on Foata normal form. 39/9877 useless extension candidates. Maximal degree in co-relation 41778. Up to 2263 conditions per place. [2021-10-28 09:39:01,178 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 19 selfloop transitions, 6 changer transitions 4/258 dead transitions. [2021-10-28 09:39:01,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 258 transitions, 2314 flow [2021-10-28 09:39:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:39:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-28 09:39:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2021-10-28 09:39:01,180 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.920392584514722 [2021-10-28 09:39:01,181 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2021-10-28 09:39:01,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2021-10-28 09:39:01,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:39:01,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2021-10-28 09:39:01,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states 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:39:01,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:39:01,184 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:39:01,184 INFO L186 Difference]: Start difference. First operand has 246 places, 244 transitions, 2054 flow. Second operand 7 states and 844 transitions. [2021-10-28 09:39:01,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 258 transitions, 2314 flow [2021-10-28 09:39:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 258 transitions, 1897 flow, removed 166 selfloop flow, removed 25 redundant places. [2021-10-28 09:39:02,982 INFO L242 Difference]: Finished difference. Result has 220 places, 245 transitions, 1749 flow [2021-10-28 09:39:02,982 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1749, PETRI_PLACES=220, PETRI_TRANSITIONS=245} [2021-10-28 09:39:02,983 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 82 predicate places. [2021-10-28 09:39:02,983 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 245 transitions, 1749 flow [2021-10-28 09:39:02,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:39:02,984 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:39:02,984 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:02,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:39:02,985 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:39:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:39:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1896259146, now seen corresponding path program 2 times [2021-10-28 09:39:02,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:39:02,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427676825] [2021-10-28 09:39:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:02,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:39:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:39:03,152 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:39:03,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:39:03,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427676825] [2021-10-28 09:39:03,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427676825] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:39:03,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:39:03,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:39:03,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747777363] [2021-10-28 09:39:03,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:39:03,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:39:03,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:39:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:39:03,157 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 131 [2021-10-28 09:39:03,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 245 transitions, 1749 flow. Second operand has 9 states, 9 states have (on average 117.11111111111111) internal successors, (1054), 9 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states 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:39:03,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:39:03,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 131 [2021-10-28 09:39:03,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:39:06,307 INFO L129 PetriNetUnfolder]: 5025/13947 cut-off events. [2021-10-28 09:39:06,307 INFO L130 PetriNetUnfolder]: For 34229/52985 co-relation queries the response was YES. [2021-10-28 09:39:06,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46976 conditions, 13947 events. 5025/13947 cut-off events. For 34229/52985 co-relation queries the response was YES. Maximal size of possible extension queue 1845. Compared 178877 event pairs, 10 based on Foata normal form. 2414/15100 useless extension candidates. Maximal degree in co-relation 46919. Up to 1862 conditions per place. [2021-10-28 09:39:06,571 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 22 selfloop transitions, 63 changer transitions 26/276 dead transitions. [2021-10-28 09:39:06,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 276 transitions, 2177 flow [2021-10-28 09:39:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:39:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-10-28 09:39:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2286 transitions. [2021-10-28 09:39:06,576 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9184411410204901 [2021-10-28 09:39:06,576 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2286 transitions. [2021-10-28 09:39:06,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2286 transitions. [2021-10-28 09:39:06,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:39:06,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2286 transitions. [2021-10-28 09:39:06,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 120.3157894736842) internal successors, (2286), 19 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states 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:39:06,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states 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:39:06,589 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states 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:39:06,589 INFO L186 Difference]: Start difference. First operand has 220 places, 245 transitions, 1749 flow. Second operand 19 states and 2286 transitions. [2021-10-28 09:39:06,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 276 transitions, 2177 flow [2021-10-28 09:39:07,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 276 transitions, 1997 flow, removed 55 selfloop flow, removed 15 redundant places. [2021-10-28 09:39:07,858 INFO L242 Difference]: Finished difference. Result has 227 places, 240 transitions, 1707 flow [2021-10-28 09:39:07,858 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1707, PETRI_PLACES=227, PETRI_TRANSITIONS=240} [2021-10-28 09:39:07,859 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 89 predicate places. [2021-10-28 09:39:07,859 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 240 transitions, 1707 flow [2021-10-28 09:39:07,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.11111111111111) internal successors, (1054), 9 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states 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:39:07,859 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:39:07,860 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:07,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:39:07,860 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:39:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:39:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 605725002, now seen corresponding path program 1 times [2021-10-28 09:39:07,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:39:07,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933886350] [2021-10-28 09:39:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:07,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:39:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:39:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:39:08,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:39:08,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933886350] [2021-10-28 09:39:08,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933886350] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:39:08,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:39:08,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:39:08,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840773810] [2021-10-28 09:39:08,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:39:08,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:39:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:39:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:39:08,029 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 131 [2021-10-28 09:39:08,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 240 transitions, 1707 flow. Second operand has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:39:08,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:39:08,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 131 [2021-10-28 09:39:08,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:39:11,259 INFO L129 PetriNetUnfolder]: 4914/16221 cut-off events. [2021-10-28 09:39:11,259 INFO L130 PetriNetUnfolder]: For 46233/48770 co-relation queries the response was YES. [2021-10-28 09:39:11,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54611 conditions, 16221 events. 4914/16221 cut-off events. For 46233/48770 co-relation queries the response was YES. Maximal size of possible extension queue 2101. Compared 228193 event pairs, 20 based on Foata normal form. 32/15155 useless extension candidates. Maximal degree in co-relation 54498. Up to 1891 conditions per place. [2021-10-28 09:39:11,593 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 9 selfloop transitions, 2 changer transitions 4/245 dead transitions. [2021-10-28 09:39:11,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 245 transitions, 1751 flow [2021-10-28 09:39:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:39:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-28 09:39:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2021-10-28 09:39:11,595 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910577971646674 [2021-10-28 09:39:11,595 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2021-10-28 09:39:11,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2021-10-28 09:39:11,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:39:11,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2021-10-28 09:39:11,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:39:11,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:39:11,600 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:39:11,601 INFO L186 Difference]: Start difference. First operand has 227 places, 240 transitions, 1707 flow. Second operand 7 states and 835 transitions. [2021-10-28 09:39:11,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 245 transitions, 1751 flow [2021-10-28 09:39:13,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 245 transitions, 1569 flow, removed 43 selfloop flow, removed 20 redundant places. [2021-10-28 09:39:13,913 INFO L242 Difference]: Finished difference. Result has 215 places, 241 transitions, 1544 flow [2021-10-28 09:39:13,914 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1544, PETRI_PLACES=215, PETRI_TRANSITIONS=241} [2021-10-28 09:39:13,914 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 77 predicate places. [2021-10-28 09:39:13,914 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 241 transitions, 1544 flow [2021-10-28 09:39:13,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:39:13,915 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:39:13,915 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:13,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:39:13,915 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:39:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:39:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 772060112, now seen corresponding path program 2 times [2021-10-28 09:39:13,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:39:13,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33083726] [2021-10-28 09:39:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:13,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:39:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:39:14,048 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:39:14,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:39:14,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33083726] [2021-10-28 09:39:14,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33083726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:39:14,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:39:14,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:39:14,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748840419] [2021-10-28 09:39:14,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:39:14,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:39:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:39:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:39:14,052 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 131 [2021-10-28 09:39:14,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 241 transitions, 1544 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:39:14,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:39:14,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 131 [2021-10-28 09:39:14,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:39:18,872 INFO L129 PetriNetUnfolder]: 8181/26107 cut-off events. [2021-10-28 09:39:18,872 INFO L130 PetriNetUnfolder]: For 45597/47286 co-relation queries the response was YES. [2021-10-28 09:39:19,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76633 conditions, 26107 events. 8181/26107 cut-off events. For 45597/47286 co-relation queries the response was YES. Maximal size of possible extension queue 3474. Compared 390582 event pairs, 42 based on Foata normal form. 45/24413 useless extension candidates. Maximal degree in co-relation 76589. Up to 2967 conditions per place. [2021-10-28 09:39:19,290 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 8 selfloop transitions, 3 changer transitions 41/245 dead transitions. [2021-10-28 09:39:19,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 245 transitions, 1592 flow [2021-10-28 09:39:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:39:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-28 09:39:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 723 transitions. [2021-10-28 09:39:19,293 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9198473282442748 [2021-10-28 09:39:19,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 723 transitions. [2021-10-28 09:39:19,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 723 transitions. [2021-10-28 09:39:19,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:39:19,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 723 transitions. [2021-10-28 09:39:19,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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:39:19,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:39:19,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:39:19,299 INFO L186 Difference]: Start difference. First operand has 215 places, 241 transitions, 1544 flow. Second operand 6 states and 723 transitions. [2021-10-28 09:39:19,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 245 transitions, 1592 flow [2021-10-28 09:39:26,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 245 transitions, 1581 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-10-28 09:39:26,235 INFO L242 Difference]: Finished difference. Result has 217 places, 204 transitions, 1167 flow [2021-10-28 09:39:26,235 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1167, PETRI_PLACES=217, PETRI_TRANSITIONS=204} [2021-10-28 09:39:26,236 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 79 predicate places. [2021-10-28 09:39:26,236 INFO L470 AbstractCegarLoop]: Abstraction has has 217 places, 204 transitions, 1167 flow [2021-10-28 09:39:26,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:39:26,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:39:26,236 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:26,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:39:26,236 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:39:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:39:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash -700856166, now seen corresponding path program 3 times [2021-10-28 09:39:26,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:39:26,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939552118] [2021-10-28 09:39:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:26,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:39:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:39:26,824 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:39:26,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:39:26,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939552118] [2021-10-28 09:39:26,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939552118] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:39:26,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:39:26,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-28 09:39:26,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317761821] [2021-10-28 09:39:26,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-28 09:39:26,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:39:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-28 09:39:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-10-28 09:39:26,831 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2021-10-28 09:39:26,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 204 transitions, 1167 flow. Second operand has 17 states, 17 states have (on average 102.47058823529412) internal successors, (1742), 17 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states 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:39:26,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:39:26,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2021-10-28 09:39:26,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:39:29,660 INFO L129 PetriNetUnfolder]: 4737/14930 cut-off events. [2021-10-28 09:39:29,660 INFO L130 PetriNetUnfolder]: For 27421/28681 co-relation queries the response was YES. [2021-10-28 09:39:29,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44008 conditions, 14930 events. 4737/14930 cut-off events. For 27421/28681 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 206779 event pairs, 20 based on Foata normal form. 92/13972 useless extension candidates. Maximal degree in co-relation 43963. Up to 1753 conditions per place. [2021-10-28 09:39:29,861 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 27 selfloop transitions, 13 changer transitions 37/226 dead transitions. [2021-10-28 09:39:29,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 226 transitions, 1518 flow [2021-10-28 09:39:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:39:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:39:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1563 transitions. [2021-10-28 09:39:29,865 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7954198473282442 [2021-10-28 09:39:29,865 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1563 transitions. [2021-10-28 09:39:29,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1563 transitions. [2021-10-28 09:39:29,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:39:29,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1563 transitions. [2021-10-28 09:39:29,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 104.2) internal successors, (1563), 15 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states 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:39:29,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:39:29,875 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:39:29,876 INFO L186 Difference]: Start difference. First operand has 217 places, 204 transitions, 1167 flow. Second operand 15 states and 1563 transitions. [2021-10-28 09:39:29,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 226 transitions, 1518 flow [2021-10-28 09:39:31,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 226 transitions, 1439 flow, removed 30 selfloop flow, removed 9 redundant places. [2021-10-28 09:39:31,673 INFO L242 Difference]: Finished difference. Result has 219 places, 185 transitions, 1009 flow [2021-10-28 09:39:31,673 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1009, PETRI_PLACES=219, PETRI_TRANSITIONS=185} [2021-10-28 09:39:31,674 INFO L334 CegarLoopForPetriNet]: 138 programPoint places, 81 predicate places. [2021-10-28 09:39:31,674 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 185 transitions, 1009 flow [2021-10-28 09:39:31,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 102.47058823529412) internal successors, (1742), 17 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states 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:39:31,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:39:31,675 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:31,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:39:31,676 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-28 09:39:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:39:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 990005768, now seen corresponding path program 4 times [2021-10-28 09:39:31,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:39:31,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491887582] [2021-10-28 09:39:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:31,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:39:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:39:31,744 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:39:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:39:31,890 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:39:31,891 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:39:31,892 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:31,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:31,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 09:39:31,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 09:39:31,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 09:39:31,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-28 09:39:31,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:31,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:39:31,899 INFO L731 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:31,906 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 09:39:31,906 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:39:32,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:39:32 BasicIcfg [2021-10-28 09:39:32,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:39:32,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:39:32,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:39:32,397 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:39:32,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:38:33" (3/4) ... [2021-10-28 09:39:32,400 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:39:32,565 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:39:32,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:39:32,567 INFO L168 Benchmark]: Toolchain (without parser) took 62586.51 ms. Allocated memory was 98.6 MB in the beginning and 11.8 GB in the end (delta: 11.7 GB). Free memory was 75.3 MB in the beginning and 10.0 GB in the end (delta: -9.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,567 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 81.8 MB. Free memory is still 59.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:39:32,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.42 ms. Allocated memory is still 98.6 MB. Free memory was 74.9 MB in the beginning and 59.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.24 ms. Allocated memory is still 98.6 MB. Free memory was 59.0 MB in the beginning and 56.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,568 INFO L168 Benchmark]: Boogie Preprocessor took 61.00 ms. Allocated memory is still 98.6 MB. Free memory was 56.2 MB in the beginning and 53.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,569 INFO L168 Benchmark]: RCFGBuilder took 2533.22 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 53.8 MB in the beginning and 91.1 MB in the end (delta: -37.3 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,569 INFO L168 Benchmark]: TraceAbstraction took 59044.96 ms. Allocated memory was 123.7 MB in the beginning and 11.8 GB in the end (delta: 11.7 GB). Free memory was 90.3 MB in the beginning and 10.0 GB in the end (delta: -10.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,570 INFO L168 Benchmark]: Witness Printer took 168.66 ms. Allocated memory is still 11.8 GB. Free memory was 10.0 GB in the beginning and 10.0 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:32,572 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.27 ms. Allocated memory is still 81.8 MB. Free memory is still 59.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 712.42 ms. Allocated memory is still 98.6 MB. Free memory was 74.9 MB in the beginning and 59.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.24 ms. Allocated memory is still 98.6 MB. Free memory was 59.0 MB in the beginning and 56.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.00 ms. Allocated memory is still 98.6 MB. Free memory was 56.2 MB in the beginning and 53.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2533.22 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 53.8 MB in the beginning and 91.1 MB in the end (delta: -37.3 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 59044.96 ms. Allocated memory was 123.7 MB in the beginning and 11.8 GB in the end (delta: 11.7 GB). Free memory was 90.3 MB in the beginning and 10.0 GB in the end (delta: -10.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.1 GB. * Witness Printer took 168.66 ms. Allocated memory is still 11.8 GB. Free memory was 10.0 GB in the beginning and 10.0 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L726] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L727] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L729] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L730] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L731] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L737] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L738] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L739] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L740] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L741] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L742] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] 0 pthread_t t1185; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L862] 0 pthread_t t1188; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 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: 58.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 205 SDtfs, 833 SDslu, 802 SDs, 0 SdLazy, 1734 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2553occurred in iteration=11, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1616 NumberOfCodeBlocks, 1616 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1497 ConstructedInterpolants, 0 QuantifiedInterpolants, 8907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 09:39:32,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ea5e9b2-beaa-459a-b375-b0579fa784b7/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...