./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/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_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/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_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 08:54:21,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:54:21,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:54:21,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:54:21,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:54:21,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:54:21,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:54:21,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:54:21,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:54:21,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:54:21,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:54:21,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:54:21,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:54:21,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:54:21,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:54:21,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:54:21,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:54:21,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:54:21,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:54:21,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:54:21,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:54:21,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:54:21,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:54:21,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:54:21,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:54:21,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:54:21,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:54:21,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:54:21,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:54:21,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:54:21,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:54:21,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:54:21,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:54:21,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:54:21,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:54:21,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:54:21,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:54:21,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:54:21,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:54:21,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:54:21,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:54:21,523 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 08:54:21,572 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:54:21,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:54:21,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:54:21,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:54:21,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:54:21,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:54:21,583 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:54:21,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:54:21,584 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:54:21,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:54:21,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:54:21,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:54:21,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 08:54:21,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 08:54:21,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 08:54:21,587 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:54:21,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:54:21,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:54:21,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 08:54:21,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:54:21,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:54:21,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 08:54:21,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:54:21,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:54:21,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 08:54:21,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 08:54:21,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:54:21,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 08:54:21,590 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 08:54:21,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 08:54:21,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 08:54:21,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:54:21,593 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_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/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_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2021-10-28 08:54:21,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:54:21,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:54:21,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:54:21,990 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:54:21,991 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:54:21,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-10-28 08:54:22,072 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/data/ae1bf78d3/1ba6a05e5e814c3ca29dbf8223e373e6/FLAG618f2a808 [2021-10-28 08:54:22,787 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:54:22,793 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-10-28 08:54:22,826 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/data/ae1bf78d3/1ba6a05e5e814c3ca29dbf8223e373e6/FLAG618f2a808 [2021-10-28 08:54:23,035 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/data/ae1bf78d3/1ba6a05e5e814c3ca29dbf8223e373e6 [2021-10-28 08:54:23,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:54:23,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:54:23,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:54:23,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:54:23,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:54:23,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2443be5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23, skipping insertion in model container [2021-10-28 08:54:23,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:54:23,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:54:23,350 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_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-10-28 08:54:23,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:54:23,602 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:54:23,622 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_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-10-28 08:54:23,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:54:23,781 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:54:23,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23 WrapperNode [2021-10-28 08:54:23,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:54:23,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:54:23,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:54:23,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:54:23,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:54:23,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:54:23,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:54:23,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:54:23,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:23,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:54:23,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:54:23,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:54:23,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:54:23,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (1/1) ... [2021-10-28 08:54:24,010 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:54:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:54:24,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 08:54:24,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 08:54:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 08:54:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 08:54:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:54:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 08:54:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 08:54:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 08:54:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 08:54:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 08:54:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 08:54:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 08:54:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:54:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:54:24,100 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 08:54:26,163 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:54:26,164 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 08:54:26,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:54:26 BoogieIcfgContainer [2021-10-28 08:54:26,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:54:26,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 08:54:26,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 08:54:26,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 08:54:26,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 08:54:23" (1/3) ... [2021-10-28 08:54:26,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec44e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:54:26, skipping insertion in model container [2021-10-28 08:54:26,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:23" (2/3) ... [2021-10-28 08:54:26,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec44e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:54:26, skipping insertion in model container [2021-10-28 08:54:26,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:54:26" (3/3) ... [2021-10-28 08:54:26,179 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2021-10-28 08:54:26,185 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 08:54:26,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 08:54:26,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 08:54:26,186 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 08:54:26,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,235 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,235 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,236 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,236 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,250 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,250 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,258 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,258 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:54:26,259 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 08:54:26,331 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 08:54:26,348 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 08:54:26,348 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-28 08:54:26,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-10-28 08:54:26,426 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-10-28 08:54:26,426 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:54:26,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-10-28 08:54:26,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-10-28 08:54:26,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-10-28 08:54:26,464 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-10-28 08:54:26,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:54:26,464 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:26,465 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:26,466 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash -983988078, now seen corresponding path program 1 times [2021-10-28 08:54:26,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:26,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851092207] [2021-10-28 08:54:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:26,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:26,819 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 08:54:26,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:26,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851092207] [2021-10-28 08:54:26,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851092207] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:26,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:26,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 08:54:26,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267948000] [2021-10-28 08:54:26,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:26,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:26,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:26,856 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-10-28 08:54:26,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:26,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:26,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-10-28 08:54:26,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:26,990 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2021-10-28 08:54:26,991 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:54:26,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 185 events. 16/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 597 event pairs, 6 based on Foata normal form. 9/183 useless extension candidates. Maximal degree in co-relation 185. Up to 27 conditions per place. [2021-10-28 08:54:26,994 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-10-28 08:54:26,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-10-28 08:54:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 08:54:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-10-28 08:54:27,013 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-10-28 08:54:27,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-10-28 08:54:27,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-10-28 08:54:27,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:27,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-10-28 08:54:27,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,040 INFO L186 Difference]: Start difference. First operand has 88 places, 83 transitions, 172 flow. Second operand 3 states and 239 transitions. [2021-10-28 08:54:27,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 188 flow [2021-10-28 08:54:27,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 08:54:27,055 INFO L242 Difference]: Finished difference. Result has 86 places, 79 transitions, 166 flow [2021-10-28 08:54:27,058 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2021-10-28 08:54:27,058 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, -2 predicate places. [2021-10-28 08:54:27,059 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 166 flow [2021-10-28 08:54:27,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,060 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:27,060 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:27,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 08:54:27,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:27,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash -260033218, now seen corresponding path program 1 times [2021-10-28 08:54:27,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:27,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011329027] [2021-10-28 08:54:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:27,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:27,415 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 08:54:27,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:27,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011329027] [2021-10-28 08:54:27,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011329027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:27,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:27,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:54:27,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003336014] [2021-10-28 08:54:27,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:54:27,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:27,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:54:27,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:54:27,429 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-28 08:54:27,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:27,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-28 08:54:27,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:27,670 INFO L129 PetriNetUnfolder]: 30/236 cut-off events. [2021-10-28 08:54:27,670 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:54:27,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 236 events. 30/236 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 993 event pairs, 6 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 275. Up to 36 conditions per place. [2021-10-28 08:54:27,676 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 8 selfloop transitions, 3 changer transitions 29/102 dead transitions. [2021-10-28 08:54:27,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 278 flow [2021-10-28 08:54:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:54:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 08:54:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-10-28 08:54:27,686 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-10-28 08:54:27,686 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-10-28 08:54:27,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-10-28 08:54:27,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:27,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-10-28 08:54:27,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,697 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,697 INFO L186 Difference]: Start difference. First operand has 86 places, 79 transitions, 166 flow. Second operand 9 states and 683 transitions. [2021-10-28 08:54:27,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 278 flow [2021-10-28 08:54:27,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 102 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 08:54:27,703 INFO L242 Difference]: Finished difference. Result has 99 places, 73 transitions, 189 flow [2021-10-28 08:54:27,703 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2021-10-28 08:54:27,704 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2021-10-28 08:54:27,704 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 189 flow [2021-10-28 08:54:27,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:27,705 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:27,705 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:27,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 08:54:27,705 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -81606177, now seen corresponding path program 1 times [2021-10-28 08:54:27,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:27,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091093531] [2021-10-28 08:54:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:27,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:28,121 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 08:54:28,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:28,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091093531] [2021-10-28 08:54:28,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091093531] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:28,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:28,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 08:54:28,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401681097] [2021-10-28 08:54:28,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:54:28,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:54:28,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:54:28,136 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-10-28 08:54:28,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 189 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:28,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:28,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-10-28 08:54:28,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:28,621 INFO L129 PetriNetUnfolder]: 138/390 cut-off events. [2021-10-28 08:54:28,621 INFO L130 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2021-10-28 08:54:28,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 390 events. 138/390 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1792 event pairs, 59 based on Foata normal form. 14/395 useless extension candidates. Maximal degree in co-relation 854. Up to 129 conditions per place. [2021-10-28 08:54:28,626 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 13 selfloop transitions, 9 changer transitions 35/114 dead transitions. [2021-10-28 08:54:28,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 114 transitions, 413 flow [2021-10-28 08:54:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 08:54:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 08:54:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1084 transitions. [2021-10-28 08:54:28,638 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7970588235294118 [2021-10-28 08:54:28,638 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1084 transitions. [2021-10-28 08:54:28,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1084 transitions. [2021-10-28 08:54:28,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:28,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1084 transitions. [2021-10-28 08:54:28,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 67.75) internal successors, (1084), 16 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:28,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:28,649 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:28,649 INFO L186 Difference]: Start difference. First operand has 99 places, 73 transitions, 189 flow. Second operand 16 states and 1084 transitions. [2021-10-28 08:54:28,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 114 transitions, 413 flow [2021-10-28 08:54:28,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 114 transitions, 392 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-10-28 08:54:28,660 INFO L242 Difference]: Finished difference. Result has 107 places, 77 transitions, 254 flow [2021-10-28 08:54:28,660 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=254, PETRI_PLACES=107, PETRI_TRANSITIONS=77} [2021-10-28 08:54:28,660 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2021-10-28 08:54:28,660 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 77 transitions, 254 flow [2021-10-28 08:54:28,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:28,661 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:28,662 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:28,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 08:54:28,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 581602826, now seen corresponding path program 1 times [2021-10-28 08:54:28,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:28,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073037612] [2021-10-28 08:54:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:28,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:28,953 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 08:54:28,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:28,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073037612] [2021-10-28 08:54:28,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073037612] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:28,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:28,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:54:28,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313196475] [2021-10-28 08:54:28,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 08:54:28,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 08:54:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:54:28,957 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-10-28 08:54:28,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 77 transitions, 254 flow. Second operand has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:28,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:28,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-10-28 08:54:28,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:29,394 INFO L129 PetriNetUnfolder]: 102/364 cut-off events. [2021-10-28 08:54:29,394 INFO L130 PetriNetUnfolder]: For 1027/1030 co-relation queries the response was YES. [2021-10-28 08:54:29,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 364 events. 102/364 cut-off events. For 1027/1030 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1736 event pairs, 6 based on Foata normal form. 9/364 useless extension candidates. Maximal degree in co-relation 1060. Up to 106 conditions per place. [2021-10-28 08:54:29,400 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 20 selfloop transitions, 7 changer transitions 25/112 dead transitions. [2021-10-28 08:54:29,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 592 flow [2021-10-28 08:54:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 08:54:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 08:54:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 923 transitions. [2021-10-28 08:54:29,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2021-10-28 08:54:29,405 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 923 transitions. [2021-10-28 08:54:29,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 923 transitions. [2021-10-28 08:54:29,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:29,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 923 transitions. [2021-10-28 08:54:29,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.0) internal successors, (923), 13 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:29,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:29,413 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:29,413 INFO L186 Difference]: Start difference. First operand has 107 places, 77 transitions, 254 flow. Second operand 13 states and 923 transitions. [2021-10-28 08:54:29,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 592 flow [2021-10-28 08:54:29,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 562 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-10-28 08:54:29,428 INFO L242 Difference]: Finished difference. Result has 114 places, 80 transitions, 304 flow [2021-10-28 08:54:29,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=304, PETRI_PLACES=114, PETRI_TRANSITIONS=80} [2021-10-28 08:54:29,429 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2021-10-28 08:54:29,429 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 80 transitions, 304 flow [2021-10-28 08:54:29,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:29,430 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:29,433 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:29,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 08:54:29,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:29,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1565276866, now seen corresponding path program 2 times [2021-10-28 08:54:29,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:29,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926326077] [2021-10-28 08:54:29,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:29,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:29,784 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 08:54:29,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:29,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926326077] [2021-10-28 08:54:29,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926326077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:29,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:29,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 08:54:29,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594281291] [2021-10-28 08:54:29,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 08:54:29,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 08:54:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-28 08:54:29,788 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-10-28 08:54:29,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 80 transitions, 304 flow. Second operand has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:29,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:29,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-10-28 08:54:29,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:30,151 INFO L129 PetriNetUnfolder]: 93/290 cut-off events. [2021-10-28 08:54:30,152 INFO L130 PetriNetUnfolder]: For 1583/1619 co-relation queries the response was YES. [2021-10-28 08:54:30,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 290 events. 93/290 cut-off events. For 1583/1619 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1097 event pairs, 22 based on Foata normal form. 13/297 useless extension candidates. Maximal degree in co-relation 1150. Up to 101 conditions per place. [2021-10-28 08:54:30,157 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 18 selfloop transitions, 7 changer transitions 19/102 dead transitions. [2021-10-28 08:54:30,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 102 transitions, 606 flow [2021-10-28 08:54:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 08:54:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-28 08:54:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 821 transitions. [2021-10-28 08:54:30,161 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8049019607843138 [2021-10-28 08:54:30,161 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 821 transitions. [2021-10-28 08:54:30,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 821 transitions. [2021-10-28 08:54:30,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:30,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 821 transitions. [2021-10-28 08:54:30,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 68.41666666666667) internal successors, (821), 12 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,169 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,169 INFO L186 Difference]: Start difference. First operand has 114 places, 80 transitions, 304 flow. Second operand 12 states and 821 transitions. [2021-10-28 08:54:30,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 102 transitions, 606 flow [2021-10-28 08:54:30,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 555 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-10-28 08:54:30,177 INFO L242 Difference]: Finished difference. Result has 116 places, 80 transitions, 309 flow [2021-10-28 08:54:30,178 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=309, PETRI_PLACES=116, PETRI_TRANSITIONS=80} [2021-10-28 08:54:30,178 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-10-28 08:54:30,178 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 80 transitions, 309 flow [2021-10-28 08:54:30,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:30,180 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:30,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 08:54:30,180 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash 149924735, now seen corresponding path program 1 times [2021-10-28 08:54:30,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:30,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36043404] [2021-10-28 08:54:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:30,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:30,303 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 08:54:30,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:30,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36043404] [2021-10-28 08:54:30,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36043404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:30,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:30,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:54:30,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093582793] [2021-10-28 08:54:30,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:54:30,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:54:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:54:30,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-28 08:54:30,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 80 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:30,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-28 08:54:30,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:30,523 INFO L129 PetriNetUnfolder]: 60/316 cut-off events. [2021-10-28 08:54:30,524 INFO L130 PetriNetUnfolder]: For 1616/1656 co-relation queries the response was YES. [2021-10-28 08:54:30,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 316 events. 60/316 cut-off events. For 1616/1656 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1598 event pairs, 25 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 1099. Up to 49 conditions per place. [2021-10-28 08:54:30,530 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 13 selfloop transitions, 6 changer transitions 6/94 dead transitions. [2021-10-28 08:54:30,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 94 transitions, 505 flow [2021-10-28 08:54:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:54:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 08:54:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 674 transitions. [2021-10-28 08:54:30,534 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810457516339869 [2021-10-28 08:54:30,534 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 674 transitions. [2021-10-28 08:54:30,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 674 transitions. [2021-10-28 08:54:30,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:30,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 674 transitions. [2021-10-28 08:54:30,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.88888888888889) internal successors, (674), 9 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,541 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,541 INFO L186 Difference]: Start difference. First operand has 116 places, 80 transitions, 309 flow. Second operand 9 states and 674 transitions. [2021-10-28 08:54:30,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 94 transitions, 505 flow [2021-10-28 08:54:30,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 94 transitions, 420 flow, removed 37 selfloop flow, removed 13 redundant places. [2021-10-28 08:54:30,550 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 335 flow [2021-10-28 08:54:30,551 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=335, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2021-10-28 08:54:30,551 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 24 predicate places. [2021-10-28 08:54:30,551 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 335 flow [2021-10-28 08:54:30,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,552 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:30,552 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:30,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 08:54:30,553 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash -857863622, now seen corresponding path program 1 times [2021-10-28 08:54:30,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:30,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304777444] [2021-10-28 08:54:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:30,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:30,849 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 08:54:30,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:30,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304777444] [2021-10-28 08:54:30,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304777444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:30,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:30,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 08:54:30,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579365885] [2021-10-28 08:54:30,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 08:54:30,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 08:54:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-28 08:54:30,854 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-10-28 08:54:30,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 335 flow. Second operand has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:30,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:30,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-10-28 08:54:30,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:31,203 INFO L129 PetriNetUnfolder]: 136/429 cut-off events. [2021-10-28 08:54:31,203 INFO L130 PetriNetUnfolder]: For 2158/2231 co-relation queries the response was YES. [2021-10-28 08:54:31,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 429 events. 136/429 cut-off events. For 2158/2231 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2139 event pairs, 58 based on Foata normal form. 13/428 useless extension candidates. Maximal degree in co-relation 1723. Up to 194 conditions per place. [2021-10-28 08:54:31,209 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 16 selfloop transitions, 11 changer transitions 17/101 dead transitions. [2021-10-28 08:54:31,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 601 flow [2021-10-28 08:54:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:54:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 08:54:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 676 transitions. [2021-10-28 08:54:31,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7952941176470588 [2021-10-28 08:54:31,213 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 676 transitions. [2021-10-28 08:54:31,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 676 transitions. [2021-10-28 08:54:31,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:31,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 676 transitions. [2021-10-28 08:54:31,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 67.6) internal successors, (676), 10 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,219 INFO L186 Difference]: Start difference. First operand has 112 places, 83 transitions, 335 flow. Second operand 10 states and 676 transitions. [2021-10-28 08:54:31,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 601 flow [2021-10-28 08:54:31,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 101 transitions, 566 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-10-28 08:54:31,230 INFO L242 Difference]: Finished difference. Result has 118 places, 82 transitions, 337 flow [2021-10-28 08:54:31,231 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=337, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2021-10-28 08:54:31,231 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 30 predicate places. [2021-10-28 08:54:31,231 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 337 flow [2021-10-28 08:54:31,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:31,232 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:31,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 08:54:31,233 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -191210822, now seen corresponding path program 2 times [2021-10-28 08:54:31,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:31,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159915903] [2021-10-28 08:54:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:31,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:31,478 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 08:54:31,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:31,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159915903] [2021-10-28 08:54:31,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159915903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:31,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:31,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 08:54:31,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123028724] [2021-10-28 08:54:31,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:54:31,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:54:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:54:31,483 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-10-28 08:54:31,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 337 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:31,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-10-28 08:54:31,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:31,934 INFO L129 PetriNetUnfolder]: 102/358 cut-off events. [2021-10-28 08:54:31,934 INFO L130 PetriNetUnfolder]: For 1944/2070 co-relation queries the response was YES. [2021-10-28 08:54:31,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 358 events. 102/358 cut-off events. For 1944/2070 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1653 event pairs, 41 based on Foata normal form. 17/363 useless extension candidates. Maximal degree in co-relation 1438. Up to 149 conditions per place. [2021-10-28 08:54:31,941 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 18 selfloop transitions, 11 changer transitions 20/105 dead transitions. [2021-10-28 08:54:31,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 105 transitions, 689 flow [2021-10-28 08:54:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 08:54:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 08:54:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 866 transitions. [2021-10-28 08:54:31,945 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.783710407239819 [2021-10-28 08:54:31,946 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 866 transitions. [2021-10-28 08:54:31,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 866 transitions. [2021-10-28 08:54:31,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:31,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 866 transitions. [2021-10-28 08:54:31,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,954 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,954 INFO L186 Difference]: Start difference. First operand has 118 places, 82 transitions, 337 flow. Second operand 13 states and 866 transitions. [2021-10-28 08:54:31,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 105 transitions, 689 flow [2021-10-28 08:54:31,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 628 flow, removed 21 selfloop flow, removed 11 redundant places. [2021-10-28 08:54:31,965 INFO L242 Difference]: Finished difference. Result has 120 places, 83 transitions, 359 flow [2021-10-28 08:54:31,966 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=359, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2021-10-28 08:54:31,966 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-10-28 08:54:31,966 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 359 flow [2021-10-28 08:54:31,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:31,967 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:31,967 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:31,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 08:54:31,968 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1829531136, now seen corresponding path program 3 times [2021-10-28 08:54:31,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:31,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582022875] [2021-10-28 08:54:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:31,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:32,235 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 08:54:32,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:32,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582022875] [2021-10-28 08:54:32,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582022875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:32,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:32,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 08:54:32,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145359306] [2021-10-28 08:54:32,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:54:32,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:54:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:54:32,239 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-10-28 08:54:32,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 359 flow. Second operand has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:32,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:32,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-10-28 08:54:32,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:32,584 INFO L129 PetriNetUnfolder]: 102/353 cut-off events. [2021-10-28 08:54:32,584 INFO L130 PetriNetUnfolder]: For 3632/3755 co-relation queries the response was YES. [2021-10-28 08:54:32,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 353 events. 102/353 cut-off events. For 3632/3755 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1612 event pairs, 42 based on Foata normal form. 17/358 useless extension candidates. Maximal degree in co-relation 1771. Up to 150 conditions per place. [2021-10-28 08:54:32,591 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 17 selfloop transitions, 13 changer transitions 11/98 dead transitions. [2021-10-28 08:54:32,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 98 transitions, 678 flow [2021-10-28 08:54:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:54:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 08:54:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2021-10-28 08:54:32,595 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2021-10-28 08:54:32,595 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 675 transitions. [2021-10-28 08:54:32,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 675 transitions. [2021-10-28 08:54:32,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:32,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 675 transitions. [2021-10-28 08:54:32,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 67.5) internal successors, (675), 10 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:32,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:32,601 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:32,601 INFO L186 Difference]: Start difference. First operand has 120 places, 83 transitions, 359 flow. Second operand 10 states and 675 transitions. [2021-10-28 08:54:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 98 transitions, 678 flow [2021-10-28 08:54:32,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 98 transitions, 599 flow, removed 29 selfloop flow, removed 11 redundant places. [2021-10-28 08:54:32,613 INFO L242 Difference]: Finished difference. Result has 116 places, 86 transitions, 402 flow [2021-10-28 08:54:32,613 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=116, PETRI_TRANSITIONS=86} [2021-10-28 08:54:32,613 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-10-28 08:54:32,614 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 86 transitions, 402 flow [2021-10-28 08:54:32,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:32,614 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:32,614 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:32,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 08:54:32,615 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1961170440, now seen corresponding path program 4 times [2021-10-28 08:54:32,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:32,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158415274] [2021-10-28 08:54:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:32,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:32,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:32,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158415274] [2021-10-28 08:54:32,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158415274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:32,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:32,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 08:54:32,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063287613] [2021-10-28 08:54:32,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 08:54:32,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 08:54:32,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-28 08:54:32,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-10-28 08:54:32,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 86 transitions, 402 flow. Second operand has 10 states, 10 states have (on average 66.3) internal successors, (663), 10 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:32,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:32,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-10-28 08:54:32,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:33,518 INFO L129 PetriNetUnfolder]: 100/386 cut-off events. [2021-10-28 08:54:33,518 INFO L130 PetriNetUnfolder]: For 3498/3665 co-relation queries the response was YES. [2021-10-28 08:54:33,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 386 events. 100/386 cut-off events. For 3498/3665 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1991 event pairs, 24 based on Foata normal form. 26/397 useless extension candidates. Maximal degree in co-relation 1812. Up to 118 conditions per place. [2021-10-28 08:54:33,524 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 19 selfloop transitions, 14 changer transitions 23/114 dead transitions. [2021-10-28 08:54:33,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 894 flow [2021-10-28 08:54:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 08:54:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 08:54:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 958 transitions. [2021-10-28 08:54:33,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8050420168067227 [2021-10-28 08:54:33,530 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 958 transitions. [2021-10-28 08:54:33,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 958 transitions. [2021-10-28 08:54:33,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:33,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 958 transitions. [2021-10-28 08:54:33,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 68.42857142857143) internal successors, (958), 14 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:33,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:33,539 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:33,539 INFO L186 Difference]: Start difference. First operand has 116 places, 86 transitions, 402 flow. Second operand 14 states and 958 transitions. [2021-10-28 08:54:33,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 894 flow [2021-10-28 08:54:33,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 773 flow, removed 59 selfloop flow, removed 8 redundant places. [2021-10-28 08:54:33,555 INFO L242 Difference]: Finished difference. Result has 125 places, 85 transitions, 430 flow [2021-10-28 08:54:33,556 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2021-10-28 08:54:33,556 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2021-10-28 08:54:33,556 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 430 flow [2021-10-28 08:54:33,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.3) internal successors, (663), 10 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:33,557 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:33,557 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:33,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 08:54:33,558 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:33,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 729552812, now seen corresponding path program 1 times [2021-10-28 08:54:33,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:33,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216445039] [2021-10-28 08:54:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:33,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:33,983 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 08:54:33,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:33,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216445039] [2021-10-28 08:54:33,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216445039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:33,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:33,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 08:54:33,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334652361] [2021-10-28 08:54:33,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 08:54:33,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 08:54:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:54:33,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 85 [2021-10-28 08:54:33,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 430 flow. Second operand has 15 states, 15 states have (on average 59.266666666666666) internal successors, (889), 15 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:33,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:33,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 85 [2021-10-28 08:54:33,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:34,983 INFO L129 PetriNetUnfolder]: 262/802 cut-off events. [2021-10-28 08:54:34,983 INFO L130 PetriNetUnfolder]: For 6570/6590 co-relation queries the response was YES. [2021-10-28 08:54:34,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 802 events. 262/802 cut-off events. For 6570/6590 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5254 event pairs, 21 based on Foata normal form. 17/815 useless extension candidates. Maximal degree in co-relation 3154. Up to 254 conditions per place. [2021-10-28 08:54:34,996 INFO L132 encePairwiseOnDemand]: 70/85 looper letters, 35 selfloop transitions, 11 changer transitions 54/151 dead transitions. [2021-10-28 08:54:34,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 151 transitions, 1292 flow [2021-10-28 08:54:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-28 08:54:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-28 08:54:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1604 transitions. [2021-10-28 08:54:35,001 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7257918552036199 [2021-10-28 08:54:35,001 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1604 transitions. [2021-10-28 08:54:35,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1604 transitions. [2021-10-28 08:54:35,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:35,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1604 transitions. [2021-10-28 08:54:35,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 61.69230769230769) internal successors, (1604), 26 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 85.0) internal successors, (2295), 27 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,021 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 85.0) internal successors, (2295), 27 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,021 INFO L186 Difference]: Start difference. First operand has 125 places, 85 transitions, 430 flow. Second operand 26 states and 1604 transitions. [2021-10-28 08:54:35,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 151 transitions, 1292 flow [2021-10-28 08:54:35,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 1033 flow, removed 121 selfloop flow, removed 13 redundant places. [2021-10-28 08:54:35,038 INFO L242 Difference]: Finished difference. Result has 150 places, 83 transitions, 453 flow [2021-10-28 08:54:35,038 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=453, PETRI_PLACES=150, PETRI_TRANSITIONS=83} [2021-10-28 08:54:35,038 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 62 predicate places. [2021-10-28 08:54:35,039 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 83 transitions, 453 flow [2021-10-28 08:54:35,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 59.266666666666666) internal successors, (889), 15 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,039 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:35,040 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:35,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 08:54:35,040 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:35,041 INFO L85 PathProgramCache]: Analyzing trace with hash -673174030, now seen corresponding path program 2 times [2021-10-28 08:54:35,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:35,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135492352] [2021-10-28 08:54:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:35,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:35,434 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 08:54:35,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:35,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135492352] [2021-10-28 08:54:35,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135492352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:35,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:35,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 08:54:35,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602478276] [2021-10-28 08:54:35,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 08:54:35,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:35,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 08:54:35,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-28 08:54:35,438 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-10-28 08:54:35,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 83 transitions, 453 flow. Second operand has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:35,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-10-28 08:54:35,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:35,959 INFO L129 PetriNetUnfolder]: 77/325 cut-off events. [2021-10-28 08:54:35,959 INFO L130 PetriNetUnfolder]: For 5126/5269 co-relation queries the response was YES. [2021-10-28 08:54:35,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 325 events. 77/325 cut-off events. For 5126/5269 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1575 event pairs, 37 based on Foata normal form. 40/352 useless extension candidates. Maximal degree in co-relation 1722. Up to 120 conditions per place. [2021-10-28 08:54:35,966 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 17 selfloop transitions, 5 changer transitions 15/95 dead transitions. [2021-10-28 08:54:35,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 95 transitions, 779 flow [2021-10-28 08:54:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 08:54:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 08:54:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 917 transitions. [2021-10-28 08:54:35,969 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7705882352941177 [2021-10-28 08:54:35,969 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 917 transitions. [2021-10-28 08:54:35,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 917 transitions. [2021-10-28 08:54:35,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:35,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 917 transitions. [2021-10-28 08:54:35,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 65.5) internal successors, (917), 14 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,980 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:35,980 INFO L186 Difference]: Start difference. First operand has 150 places, 83 transitions, 453 flow. Second operand 14 states and 917 transitions. [2021-10-28 08:54:35,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 95 transitions, 779 flow [2021-10-28 08:54:36,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 95 transitions, 621 flow, removed 71 selfloop flow, removed 18 redundant places. [2021-10-28 08:54:36,009 INFO L242 Difference]: Finished difference. Result has 132 places, 79 transitions, 387 flow [2021-10-28 08:54:36,010 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=387, PETRI_PLACES=132, PETRI_TRANSITIONS=79} [2021-10-28 08:54:36,010 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 44 predicate places. [2021-10-28 08:54:36,010 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 79 transitions, 387 flow [2021-10-28 08:54:36,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,012 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:36,012 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:36,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 08:54:36,012 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1228993504, now seen corresponding path program 3 times [2021-10-28 08:54:36,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:36,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535356797] [2021-10-28 08:54:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:36,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:36,369 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 08:54:36,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:36,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535356797] [2021-10-28 08:54:36,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535356797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:36,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:36,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 08:54:36,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996618989] [2021-10-28 08:54:36,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 08:54:36,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 08:54:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-28 08:54:36,374 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-10-28 08:54:36,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 79 transitions, 387 flow. Second operand has 11 states, 11 states have (on average 64.45454545454545) internal successors, (709), 11 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:36,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-10-28 08:54:36,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:36,746 INFO L129 PetriNetUnfolder]: 80/384 cut-off events. [2021-10-28 08:54:36,746 INFO L130 PetriNetUnfolder]: For 3504/3618 co-relation queries the response was YES. [2021-10-28 08:54:36,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 384 events. 80/384 cut-off events. For 3504/3618 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2155 event pairs, 16 based on Foata normal form. 29/403 useless extension candidates. Maximal degree in co-relation 1634. Up to 87 conditions per place. [2021-10-28 08:54:36,753 INFO L132 encePairwiseOnDemand]: 75/85 looper letters, 19 selfloop transitions, 8 changer transitions 10/95 dead transitions. [2021-10-28 08:54:36,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 95 transitions, 689 flow [2021-10-28 08:54:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 08:54:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 08:54:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 856 transitions. [2021-10-28 08:54:36,755 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7746606334841629 [2021-10-28 08:54:36,756 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 856 transitions. [2021-10-28 08:54:36,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 856 transitions. [2021-10-28 08:54:36,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:36,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 856 transitions. [2021-10-28 08:54:36,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.84615384615384) internal successors, (856), 13 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,763 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,763 INFO L186 Difference]: Start difference. First operand has 132 places, 79 transitions, 387 flow. Second operand 13 states and 856 transitions. [2021-10-28 08:54:36,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 95 transitions, 689 flow [2021-10-28 08:54:36,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 562 flow, removed 55 selfloop flow, removed 18 redundant places. [2021-10-28 08:54:36,777 INFO L242 Difference]: Finished difference. Result has 122 places, 79 transitions, 362 flow [2021-10-28 08:54:36,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=362, PETRI_PLACES=122, PETRI_TRANSITIONS=79} [2021-10-28 08:54:36,778 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2021-10-28 08:54:36,778 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 79 transitions, 362 flow [2021-10-28 08:54:36,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.45454545454545) internal successors, (709), 11 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,779 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:36,779 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:36,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 08:54:36,779 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -813929410, now seen corresponding path program 1 times [2021-10-28 08:54:36,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:36,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157897853] [2021-10-28 08:54:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:36,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:36,881 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 08:54:36,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:36,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157897853] [2021-10-28 08:54:36,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157897853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:36,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:36,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:54:36,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773370937] [2021-10-28 08:54:36,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:54:36,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:54:36,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:54:36,884 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-28 08:54:36,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 79 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:36,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:36,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-28 08:54:36,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:37,083 INFO L129 PetriNetUnfolder]: 157/586 cut-off events. [2021-10-28 08:54:37,083 INFO L130 PetriNetUnfolder]: For 3929/3987 co-relation queries the response was YES. [2021-10-28 08:54:37,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 586 events. 157/586 cut-off events. For 3929/3987 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4129 event pairs, 10 based on Foata normal form. 35/575 useless extension candidates. Maximal degree in co-relation 1983. Up to 173 conditions per place. [2021-10-28 08:54:37,092 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 12 changer transitions 10/100 dead transitions. [2021-10-28 08:54:37,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 574 flow [2021-10-28 08:54:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:54:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 08:54:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-10-28 08:54:37,095 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-10-28 08:54:37,095 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-10-28 08:54:37,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-10-28 08:54:37,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:37,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-10-28 08:54:37,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,101 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,101 INFO L186 Difference]: Start difference. First operand has 122 places, 79 transitions, 362 flow. Second operand 10 states and 755 transitions. [2021-10-28 08:54:37,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 574 flow [2021-10-28 08:54:37,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 100 transitions, 516 flow, removed 22 selfloop flow, removed 16 redundant places. [2021-10-28 08:54:37,112 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 369 flow [2021-10-28 08:54:37,113 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2021-10-28 08:54:37,113 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 25 predicate places. [2021-10-28 08:54:37,113 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 369 flow [2021-10-28 08:54:37,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,114 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:37,114 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:37,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 08:54:37,114 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash 907903445, now seen corresponding path program 1 times [2021-10-28 08:54:37,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:37,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103619736] [2021-10-28 08:54:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:37,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:37,220 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 08:54:37,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:37,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103619736] [2021-10-28 08:54:37,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103619736] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:37,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:37,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 08:54:37,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682862438] [2021-10-28 08:54:37,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:54:37,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:37,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:54:37,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:54:37,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-10-28 08:54:37,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:54:37,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-10-28 08:54:37,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:54:37,436 INFO L129 PetriNetUnfolder]: 51/261 cut-off events. [2021-10-28 08:54:37,436 INFO L130 PetriNetUnfolder]: For 1251/1329 co-relation queries the response was YES. [2021-10-28 08:54:37,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 261 events. 51/261 cut-off events. For 1251/1329 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1374 event pairs, 0 based on Foata normal form. 39/291 useless extension candidates. Maximal degree in co-relation 811. Up to 68 conditions per place. [2021-10-28 08:54:37,439 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 11 selfloop transitions, 15 changer transitions 14/103 dead transitions. [2021-10-28 08:54:37,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 103 transitions, 553 flow [2021-10-28 08:54:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 08:54:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 08:54:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 970 transitions. [2021-10-28 08:54:37,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8778280542986425 [2021-10-28 08:54:37,442 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 970 transitions. [2021-10-28 08:54:37,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 970 transitions. [2021-10-28 08:54:37,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:54:37,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 970 transitions. [2021-10-28 08:54:37,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.61538461538461) internal successors, (970), 13 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,454 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,454 INFO L186 Difference]: Start difference. First operand has 113 places, 85 transitions, 369 flow. Second operand 13 states and 970 transitions. [2021-10-28 08:54:37,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 103 transitions, 553 flow [2021-10-28 08:54:37,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 103 transitions, 435 flow, removed 50 selfloop flow, removed 12 redundant places. [2021-10-28 08:54:37,462 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 354 flow [2021-10-28 08:54:37,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=354, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2021-10-28 08:54:37,462 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-10-28 08:54:37,463 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 354 flow [2021-10-28 08:54:37,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:37,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:54:37,464 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:37,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 08:54:37,464 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-10-28 08:54:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 587720075, now seen corresponding path program 1 times [2021-10-28 08:54:37,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:37,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349709092] [2021-10-28 08:54:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:37,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:54:37,506 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:54:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:54:37,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:54:37,633 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 08:54:37,635 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:54:37,637 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:54:37,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 08:54:37,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 08:54:37,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:54:37,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 08:54:37,642 INFO L731 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:37,649 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 08:54:37,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 08:54:37,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 08:54:37 BasicIcfg [2021-10-28 08:54:37,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 08:54:37,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 08:54:37,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 08:54:37,841 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 08:54:37,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:54:26" (3/4) ... [2021-10-28 08:54:37,845 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 08:54:38,004 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 08:54:38,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 08:54:38,006 INFO L168 Benchmark]: Toolchain (without parser) took 14965.63 ms. Allocated memory was 102.8 MB in the beginning and 232.8 MB in the end (delta: 130.0 MB). Free memory was 40.9 MB in the beginning and 115.6 MB in the end (delta: -74.7 MB). Peak memory consumption was 58.3 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,006 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 102.8 MB. Free memory is still 58.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:54:38,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.50 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 40.6 MB in the beginning and 91.2 MB in the end (delta: -50.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.56 ms. Allocated memory is still 127.9 MB. Free memory was 91.2 MB in the beginning and 88.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,009 INFO L168 Benchmark]: Boogie Preprocessor took 85.97 ms. Allocated memory is still 127.9 MB. Free memory was 88.3 MB in the beginning and 86.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,009 INFO L168 Benchmark]: RCFGBuilder took 2178.55 ms. Allocated memory is still 127.9 MB. Free memory was 86.2 MB in the beginning and 89.5 MB in the end (delta: -3.3 MB). Peak memory consumption was 48.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,009 INFO L168 Benchmark]: TraceAbstraction took 11670.66 ms. Allocated memory was 127.9 MB in the beginning and 232.8 MB in the end (delta: 104.9 MB). Free memory was 89.5 MB in the beginning and 134.5 MB in the end (delta: -45.0 MB). Peak memory consumption was 59.5 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,010 INFO L168 Benchmark]: Witness Printer took 163.82 ms. Allocated memory is still 232.8 MB. Free memory was 134.5 MB in the beginning and 115.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:54:38,012 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.30 ms. Allocated memory is still 102.8 MB. Free memory is still 58.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 740.50 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 40.6 MB in the beginning and 91.2 MB in the end (delta: -50.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 118.56 ms. Allocated memory is still 127.9 MB. Free memory was 91.2 MB in the beginning and 88.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.97 ms. Allocated memory is still 127.9 MB. Free memory was 88.3 MB in the beginning and 86.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2178.55 ms. Allocated memory is still 127.9 MB. Free memory was 86.2 MB in the beginning and 89.5 MB in the end (delta: -3.3 MB). Peak memory consumption was 48.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11670.66 ms. Allocated memory was 127.9 MB in the beginning and 232.8 MB in the end (delta: 104.9 MB). Free memory was 89.5 MB in the beginning and 134.5 MB in the end (delta: -45.0 MB). Peak memory consumption was 59.5 MB. Max. memory is 16.1 GB. * Witness Printer took 163.82 ms. Allocated memory is still 232.8 MB. Free memory was 134.5 MB in the beginning and 115.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 511 SDslu, 658 SDs, 0 SdLazy, 1308 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=11, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 5525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 08:54:38,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40c36a69-9bb3-41ea-8c0d-fa719be9f77b/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...