./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa --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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:39:26,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:39:26,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:39:26,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:39:26,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:39:26,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:39:26,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:39:26,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:39:26,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:39:26,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:39:26,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:39:26,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:39:26,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:39:26,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:39:26,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:39:26,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:39:26,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:39:26,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:39:26,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:39:26,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:39:26,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:39:26,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:39:26,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:39:26,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:39:26,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:39:26,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:39:26,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:39:26,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:39:26,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:39:26,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:39:26,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:39:26,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:39:26,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:39:26,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:39:26,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:39:26,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:39:26,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:39:26,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:39:26,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:39:26,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:39:26,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:39:26,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:39:26,829 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:39:26,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:39:26,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:39:26,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:39:26,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:39:26,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:39:26,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:39:26,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:39:26,831 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:39:26,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:39:26,832 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:39:26,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:39:26,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:39:26,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:39:26,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:39:26,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:39:26,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:39:26,833 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:39:26,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:39:26,833 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:39:26,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:39:26,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:39:26,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:39:26,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:39:26,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:39:26,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:39:26,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:39:26,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:39:26,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:39:26,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:39:26,836 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:39:26,836 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:39:26,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:39:26,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:39:26,836 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_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/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_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2021-12-06 17:39:27,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:39:27,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:39:27,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:39:27,039 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:39:27,039 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:39:27,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-06 17:39:27,082 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/data/e8fb79f97/6d71ac7bc3ab474fa7f6af7db863d58c/FLAG1ebf02520 [2021-12-06 17:39:27,540 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:39:27,541 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-06 17:39:27,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/data/e8fb79f97/6d71ac7bc3ab474fa7f6af7db863d58c/FLAG1ebf02520 [2021-12-06 17:39:27,562 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/data/e8fb79f97/6d71ac7bc3ab474fa7f6af7db863d58c [2021-12-06 17:39:27,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:39:27,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:39:27,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:39:27,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:39:27,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:39:27,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:27,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349b7f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27, skipping insertion in model container [2021-12-06 17:39:27,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:27,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:39:27,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:39:27,723 WARN L230 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_6f03045c-238e-4ee9-ba42-012ed5c9611d/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-06 17:39:27,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:39:27,880 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:39:27,889 WARN L230 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_6f03045c-238e-4ee9-ba42-012ed5c9611d/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-06 17:39:27,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:39:27,961 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:39:27,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27 WrapperNode [2021-12-06 17:39:27,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:39:27,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:39:27,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:39:27,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:39:27,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:27,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,008 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 289 [2021-12-06 17:39:28,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:39:28,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:39:28,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:39:28,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:39:28,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:39:28,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:39:28,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:39:28,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:39:28,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (1/1) ... [2021-12-06 17:39:28,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:39:28,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:39:28,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:39:28,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:39:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 17:39:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 17:39:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:39:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 17:39:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:39:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 17:39:28,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 17:39:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 17:39:28,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 17:39:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 17:39:28,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 17:39:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-06 17:39:28,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-06 17:39:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:39:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 17:39:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:39:28,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:39:28,116 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 17:39:28,227 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:39:28,229 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:39:28,606 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:39:28,816 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:39:28,816 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 17:39:28,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:28 BoogieIcfgContainer [2021-12-06 17:39:28,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:39:28,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:39:28,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:39:28,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:39:28,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:39:27" (1/3) ... [2021-12-06 17:39:28,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e19f7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:39:28, skipping insertion in model container [2021-12-06 17:39:28,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:27" (2/3) ... [2021-12-06 17:39:28,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e19f7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:39:28, skipping insertion in model container [2021-12-06 17:39:28,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:28" (3/3) ... [2021-12-06 17:39:28,824 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-06 17:39:28,827 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 17:39:28,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:39:28,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 17:39:28,828 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 17:39:28,857 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,857 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,857 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,857 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,858 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,858 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,858 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,858 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,858 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,859 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,859 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,859 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,860 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,860 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,860 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,861 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,861 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,862 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,862 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,862 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,862 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,863 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,864 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,864 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,864 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,864 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,864 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,864 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,865 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,865 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,865 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,865 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,866 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,866 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,866 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,866 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,866 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,867 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,867 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,867 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,867 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,867 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,867 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,868 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,868 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,868 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,868 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,868 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,868 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,870 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,870 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,870 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,870 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,872 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,872 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,872 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,875 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,876 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,876 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,876 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,876 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,876 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,877 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,877 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,878 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,878 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,878 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,880 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,880 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,880 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,880 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,881 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,881 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 17:39:28,881 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 17:39:28,925 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:39:28,930 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-12-06 17:39:28,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-06 17:39:28,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2021-12-06 17:39:28,982 INFO L129 PetriNetUnfolder]: 2/128 cut-off events. [2021-12-06 17:39:28,982 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 17:39:28,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2021-12-06 17:39:28,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2021-12-06 17:39:28,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2021-12-06 17:39:29,003 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2021-12-06 17:39:29,003 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 17:39:29,003 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:29,003 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:29,004 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1238926700, now seen corresponding path program 1 times [2021-12-06 17:39:29,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:29,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100032984] [2021-12-06 17:39:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:29,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:29,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100032984] [2021-12-06 17:39:29,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100032984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:29,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:29,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:39:29,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857446148] [2021-12-06 17:39:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:29,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:39:29,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:29,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:39:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:29,291 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 132 [2021-12-06 17:39:29,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:29,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:29,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 132 [2021-12-06 17:39:29,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:29,408 INFO L129 PetriNetUnfolder]: 17/270 cut-off events. [2021-12-06 17:39:29,408 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-12-06 17:39:29,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 270 events. 17/270 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 806 event pairs, 7 based on Foata normal form. 8/266 useless extension candidates. Maximal degree in co-relation 271. Up to 27 conditions per place. [2021-12-06 17:39:29,413 INFO L132 encePairwiseOnDemand]: 127/132 looper letters, 11 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2021-12-06 17:39:29,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 127 transitions, 292 flow [2021-12-06 17:39:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:39:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 17:39:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-12-06 17:39:29,431 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2021-12-06 17:39:29,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2021-12-06 17:39:29,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2021-12-06 17:39:29,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:29,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2021-12-06 17:39:29,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:29,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:29,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:29,445 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 3 states and 372 transitions. [2021-12-06 17:39:29,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 127 transitions, 292 flow [2021-12-06 17:39:29,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 17:39:29,451 INFO L242 Difference]: Finished difference. Result has 135 places, 124 transitions, 260 flow [2021-12-06 17:39:29,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2021-12-06 17:39:29,455 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, -4 predicate places. [2021-12-06 17:39:29,455 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 260 flow [2021-12-06 17:39:29,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:29,456 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:29,456 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:29,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:39:29,456 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1562893151, now seen corresponding path program 1 times [2021-12-06 17:39:29,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42816598] [2021-12-06 17:39:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:29,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:29,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:29,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42816598] [2021-12-06 17:39:29,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42816598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:29,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:29,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:39:29,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223171124] [2021-12-06 17:39:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:29,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:29,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:29,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:29,706 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-06 17:39:29,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:29,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:29,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-06 17:39:29,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:30,090 INFO L129 PetriNetUnfolder]: 357/1247 cut-off events. [2021-12-06 17:39:30,090 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-12-06 17:39:30,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 1247 events. 357/1247 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8579 event pairs, 56 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1873. Up to 333 conditions per place. [2021-12-06 17:39:30,100 INFO L132 encePairwiseOnDemand]: 125/132 looper letters, 21 selfloop transitions, 3 changer transitions 50/167 dead transitions. [2021-12-06 17:39:30,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 167 transitions, 486 flow [2021-12-06 17:39:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:39:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 17:39:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1053 transitions. [2021-12-06 17:39:30,105 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2021-12-06 17:39:30,105 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1053 transitions. [2021-12-06 17:39:30,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1053 transitions. [2021-12-06 17:39:30,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:30,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1053 transitions. [2021-12-06 17:39:30,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,116 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,116 INFO L186 Difference]: Start difference. First operand has 135 places, 124 transitions, 260 flow. Second operand 9 states and 1053 transitions. [2021-12-06 17:39:30,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 167 transitions, 486 flow [2021-12-06 17:39:30,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 167 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 17:39:30,120 INFO L242 Difference]: Finished difference. Result has 148 places, 112 transitions, 271 flow [2021-12-06 17:39:30,121 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=148, PETRI_TRANSITIONS=112} [2021-12-06 17:39:30,121 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2021-12-06 17:39:30,121 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 112 transitions, 271 flow [2021-12-06 17:39:30,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,122 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:30,122 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:30,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:39:30,122 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1378319808, now seen corresponding path program 1 times [2021-12-06 17:39:30,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:30,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525391889] [2021-12-06 17:39:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:30,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:30,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:30,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525391889] [2021-12-06 17:39:30,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525391889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:30,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:30,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:39:30,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000367416] [2021-12-06 17:39:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:30,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:30,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:30,270 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-06 17:39:30,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 112 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:30,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-06 17:39:30,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:30,704 INFO L129 PetriNetUnfolder]: 781/1649 cut-off events. [2021-12-06 17:39:30,704 INFO L130 PetriNetUnfolder]: For 1296/1296 co-relation queries the response was YES. [2021-12-06 17:39:30,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1649 events. 781/1649 cut-off events. For 1296/1296 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10444 event pairs, 118 based on Foata normal form. 36/1645 useless extension candidates. Maximal degree in co-relation 3704. Up to 653 conditions per place. [2021-12-06 17:39:30,721 INFO L132 encePairwiseOnDemand]: 125/132 looper letters, 23 selfloop transitions, 3 changer transitions 37/158 dead transitions. [2021-12-06 17:39:30,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 158 transitions, 513 flow [2021-12-06 17:39:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:39:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 17:39:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1055 transitions. [2021-12-06 17:39:30,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8880471380471381 [2021-12-06 17:39:30,726 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1055 transitions. [2021-12-06 17:39:30,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1055 transitions. [2021-12-06 17:39:30,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:30,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1055 transitions. [2021-12-06 17:39:30,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,736 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,736 INFO L186 Difference]: Start difference. First operand has 148 places, 112 transitions, 271 flow. Second operand 9 states and 1055 transitions. [2021-12-06 17:39:30,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 158 transitions, 513 flow [2021-12-06 17:39:30,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 158 transitions, 496 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-06 17:39:30,752 INFO L242 Difference]: Finished difference. Result has 139 places, 114 transitions, 305 flow [2021-12-06 17:39:30,752 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=139, PETRI_TRANSITIONS=114} [2021-12-06 17:39:30,753 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 0 predicate places. [2021-12-06 17:39:30,753 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 114 transitions, 305 flow [2021-12-06 17:39:30,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:30,754 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:30,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:39:30,754 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 323046214, now seen corresponding path program 1 times [2021-12-06 17:39:30,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:30,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225953248] [2021-12-06 17:39:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:30,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:30,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:30,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225953248] [2021-12-06 17:39:30,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225953248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:30,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:30,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:39:30,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786571092] [2021-12-06 17:39:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:30,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:39:30,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:39:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:39:30,947 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2021-12-06 17:39:30,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 114 transitions, 305 flow. Second operand has 10 states, 10 states have (on average 109.5) internal successors, (1095), 10 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:30,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:30,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2021-12-06 17:39:30,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:31,412 INFO L129 PetriNetUnfolder]: 649/1439 cut-off events. [2021-12-06 17:39:31,412 INFO L130 PetriNetUnfolder]: For 2909/2956 co-relation queries the response was YES. [2021-12-06 17:39:31,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 1439 events. 649/1439 cut-off events. For 2909/2956 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9293 event pairs, 245 based on Foata normal form. 53/1404 useless extension candidates. Maximal degree in co-relation 4007. Up to 439 conditions per place. [2021-12-06 17:39:31,426 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 18 selfloop transitions, 8 changer transitions 35/156 dead transitions. [2021-12-06 17:39:31,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 557 flow [2021-12-06 17:39:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:39:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 17:39:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1684 transitions. [2021-12-06 17:39:31,431 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8505050505050505 [2021-12-06 17:39:31,431 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1684 transitions. [2021-12-06 17:39:31,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1684 transitions. [2021-12-06 17:39:31,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:31,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1684 transitions. [2021-12-06 17:39:31,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.26666666666667) internal successors, (1684), 15 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:31,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:31,441 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:31,441 INFO L186 Difference]: Start difference. First operand has 139 places, 114 transitions, 305 flow. Second operand 15 states and 1684 transitions. [2021-12-06 17:39:31,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 557 flow [2021-12-06 17:39:31,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 156 transitions, 536 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-06 17:39:31,447 INFO L242 Difference]: Finished difference. Result has 154 places, 118 transitions, 368 flow [2021-12-06 17:39:31,448 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=368, PETRI_PLACES=154, PETRI_TRANSITIONS=118} [2021-12-06 17:39:31,448 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 15 predicate places. [2021-12-06 17:39:31,448 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 118 transitions, 368 flow [2021-12-06 17:39:31,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.5) internal successors, (1095), 10 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:31,449 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:31,449 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:31,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:39:31,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1713260181, now seen corresponding path program 1 times [2021-12-06 17:39:31,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:31,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73772019] [2021-12-06 17:39:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:31,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:31,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:31,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73772019] [2021-12-06 17:39:31,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73772019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:31,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:31,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:39:31,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896947640] [2021-12-06 17:39:31,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:31,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:39:31,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:39:31,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:39:31,608 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-12-06 17:39:31,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 118 transitions, 368 flow. Second operand has 9 states, 9 states have (on average 110.66666666666667) internal successors, (996), 9 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:31,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:31,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-12-06 17:39:31,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:32,142 INFO L129 PetriNetUnfolder]: 483/1079 cut-off events. [2021-12-06 17:39:32,143 INFO L130 PetriNetUnfolder]: For 4802/4824 co-relation queries the response was YES. [2021-12-06 17:39:32,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1079 events. 483/1079 cut-off events. For 4802/4824 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6032 event pairs, 94 based on Foata normal form. 35/1059 useless extension candidates. Maximal degree in co-relation 4037. Up to 305 conditions per place. [2021-12-06 17:39:32,156 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 22 selfloop transitions, 8 changer transitions 29/155 dead transitions. [2021-12-06 17:39:32,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 155 transitions, 720 flow [2021-12-06 17:39:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:39:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 17:39:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1695 transitions. [2021-12-06 17:39:32,163 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8560606060606061 [2021-12-06 17:39:32,163 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1695 transitions. [2021-12-06 17:39:32,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1695 transitions. [2021-12-06 17:39:32,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:32,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1695 transitions. [2021-12-06 17:39:32,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,177 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,177 INFO L186 Difference]: Start difference. First operand has 154 places, 118 transitions, 368 flow. Second operand 15 states and 1695 transitions. [2021-12-06 17:39:32,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 155 transitions, 720 flow [2021-12-06 17:39:32,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 682 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-12-06 17:39:32,187 INFO L242 Difference]: Finished difference. Result has 165 places, 121 transitions, 423 flow [2021-12-06 17:39:32,188 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=423, PETRI_PLACES=165, PETRI_TRANSITIONS=121} [2021-12-06 17:39:32,189 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 26 predicate places. [2021-12-06 17:39:32,189 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 121 transitions, 423 flow [2021-12-06 17:39:32,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.66666666666667) internal successors, (996), 9 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,190 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:32,190 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:32,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:39:32,190 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:32,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash -214302745, now seen corresponding path program 1 times [2021-12-06 17:39:32,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:32,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549983869] [2021-12-06 17:39:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:32,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:32,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:32,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549983869] [2021-12-06 17:39:32,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549983869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:32,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:32,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:39:32,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567414617] [2021-12-06 17:39:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:32,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:32,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:32,300 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-06 17:39:32,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 121 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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-12-06 17:39:32,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:32,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-06 17:39:32,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:32,659 INFO L129 PetriNetUnfolder]: 470/1288 cut-off events. [2021-12-06 17:39:32,659 INFO L130 PetriNetUnfolder]: For 7469/7605 co-relation queries the response was YES. [2021-12-06 17:39:32,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 1288 events. 470/1288 cut-off events. For 7469/7605 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8700 event pairs, 108 based on Foata normal form. 22/1217 useless extension candidates. Maximal degree in co-relation 5219. Up to 335 conditions per place. [2021-12-06 17:39:32,676 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 37 selfloop transitions, 6 changer transitions 15/155 dead transitions. [2021-12-06 17:39:32,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 155 transitions, 870 flow [2021-12-06 17:39:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:39:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 17:39:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1039 transitions. [2021-12-06 17:39:32,679 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8745791245791246 [2021-12-06 17:39:32,679 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1039 transitions. [2021-12-06 17:39:32,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1039 transitions. [2021-12-06 17:39:32,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:32,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1039 transitions. [2021-12-06 17:39:32,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,685 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,685 INFO L186 Difference]: Start difference. First operand has 165 places, 121 transitions, 423 flow. Second operand 9 states and 1039 transitions. [2021-12-06 17:39:32,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 155 transitions, 870 flow [2021-12-06 17:39:32,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 155 transitions, 765 flow, removed 46 selfloop flow, removed 12 redundant places. [2021-12-06 17:39:32,695 INFO L242 Difference]: Finished difference. Result has 159 places, 124 transitions, 451 flow [2021-12-06 17:39:32,695 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=451, PETRI_PLACES=159, PETRI_TRANSITIONS=124} [2021-12-06 17:39:32,696 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 20 predicate places. [2021-12-06 17:39:32,696 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 124 transitions, 451 flow [2021-12-06 17:39:32,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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-12-06 17:39:32,696 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:32,696 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:32,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:39:32,697 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1353895683, now seen corresponding path program 1 times [2021-12-06 17:39:32,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:32,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680405043] [2021-12-06 17:39:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:32,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:32,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680405043] [2021-12-06 17:39:32,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680405043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:32,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:32,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:39:32,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956523813] [2021-12-06 17:39:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:32,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:39:32,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:39:32,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:39:32,867 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2021-12-06 17:39:32,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 124 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:32,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:32,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2021-12-06 17:39:32,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:33,252 INFO L129 PetriNetUnfolder]: 461/1331 cut-off events. [2021-12-06 17:39:33,253 INFO L130 PetriNetUnfolder]: For 9110/9320 co-relation queries the response was YES. [2021-12-06 17:39:33,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 1331 events. 461/1331 cut-off events. For 9110/9320 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9756 event pairs, 149 based on Foata normal form. 46/1302 useless extension candidates. Maximal degree in co-relation 5486. Up to 432 conditions per place. [2021-12-06 17:39:33,267 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 21 selfloop transitions, 11 changer transitions 16/143 dead transitions. [2021-12-06 17:39:33,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 143 transitions, 741 flow [2021-12-06 17:39:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:39:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 17:39:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1012 transitions. [2021-12-06 17:39:33,271 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2021-12-06 17:39:33,271 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1012 transitions. [2021-12-06 17:39:33,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1012 transitions. [2021-12-06 17:39:33,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:33,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1012 transitions. [2021-12-06 17:39:33,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,276 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,276 INFO L186 Difference]: Start difference. First operand has 159 places, 124 transitions, 451 flow. Second operand 9 states and 1012 transitions. [2021-12-06 17:39:33,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 143 transitions, 741 flow [2021-12-06 17:39:33,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 143 transitions, 714 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-12-06 17:39:33,288 INFO L242 Difference]: Finished difference. Result has 164 places, 124 transitions, 458 flow [2021-12-06 17:39:33,288 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=458, PETRI_PLACES=164, PETRI_TRANSITIONS=124} [2021-12-06 17:39:33,289 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 25 predicate places. [2021-12-06 17:39:33,289 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 124 transitions, 458 flow [2021-12-06 17:39:33,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,289 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:33,290 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:33,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:39:33,290 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1981682447, now seen corresponding path program 2 times [2021-12-06 17:39:33,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931988544] [2021-12-06 17:39:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:33,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:33,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931988544] [2021-12-06 17:39:33,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931988544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:33,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:33,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 17:39:33,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962661686] [2021-12-06 17:39:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:33,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:39:33,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:39:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:33,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-06 17:39:33,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 124 transitions, 458 flow. Second operand has 12 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:33,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-06 17:39:33,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:33,880 INFO L129 PetriNetUnfolder]: 403/1184 cut-off events. [2021-12-06 17:39:33,880 INFO L130 PetriNetUnfolder]: For 8193/8634 co-relation queries the response was YES. [2021-12-06 17:39:33,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5245 conditions, 1184 events. 403/1184 cut-off events. For 8193/8634 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8392 event pairs, 86 based on Foata normal form. 44/1161 useless extension candidates. Maximal degree in co-relation 5154. Up to 344 conditions per place. [2021-12-06 17:39:33,895 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 24 selfloop transitions, 14 changer transitions 19/151 dead transitions. [2021-12-06 17:39:33,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 151 transitions, 856 flow [2021-12-06 17:39:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:39:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 17:39:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1659 transitions. [2021-12-06 17:39:33,899 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8378787878787879 [2021-12-06 17:39:33,899 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1659 transitions. [2021-12-06 17:39:33,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1659 transitions. [2021-12-06 17:39:33,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:33,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1659 transitions. [2021-12-06 17:39:33,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 110.6) internal successors, (1659), 15 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,907 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,907 INFO L186 Difference]: Start difference. First operand has 164 places, 124 transitions, 458 flow. Second operand 15 states and 1659 transitions. [2021-12-06 17:39:33,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 151 transitions, 856 flow [2021-12-06 17:39:33,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 151 transitions, 788 flow, removed 25 selfloop flow, removed 10 redundant places. [2021-12-06 17:39:33,916 INFO L242 Difference]: Finished difference. Result has 169 places, 126 transitions, 494 flow [2021-12-06 17:39:33,916 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=494, PETRI_PLACES=169, PETRI_TRANSITIONS=126} [2021-12-06 17:39:33,917 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 30 predicate places. [2021-12-06 17:39:33,917 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 126 transitions, 494 flow [2021-12-06 17:39:33,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:33,918 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:33,918 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:33,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 17:39:33,918 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 368731933, now seen corresponding path program 3 times [2021-12-06 17:39:33,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:33,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024319207] [2021-12-06 17:39:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:33,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:34,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:34,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024319207] [2021-12-06 17:39:34,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024319207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:34,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:34,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:39:34,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362114663] [2021-12-06 17:39:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:34,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:39:34,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:39:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:39:34,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2021-12-06 17:39:34,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 126 transitions, 494 flow. Second operand has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:34,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:34,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2021-12-06 17:39:34,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:34,432 INFO L129 PetriNetUnfolder]: 425/1276 cut-off events. [2021-12-06 17:39:34,432 INFO L130 PetriNetUnfolder]: For 13542/13733 co-relation queries the response was YES. [2021-12-06 17:39:34,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 1276 events. 425/1276 cut-off events. For 13542/13733 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9183 event pairs, 85 based on Foata normal form. 59/1257 useless extension candidates. Maximal degree in co-relation 6450. Up to 372 conditions per place. [2021-12-06 17:39:34,450 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 24 selfloop transitions, 17 changer transitions 10/146 dead transitions. [2021-12-06 17:39:34,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 146 transitions, 886 flow [2021-12-06 17:39:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:39:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 17:39:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1232 transitions. [2021-12-06 17:39:34,453 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2021-12-06 17:39:34,453 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1232 transitions. [2021-12-06 17:39:34,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1232 transitions. [2021-12-06 17:39:34,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:34,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1232 transitions. [2021-12-06 17:39:34,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:34,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:34,458 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:34,459 INFO L186 Difference]: Start difference. First operand has 169 places, 126 transitions, 494 flow. Second operand 11 states and 1232 transitions. [2021-12-06 17:39:34,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 146 transitions, 886 flow [2021-12-06 17:39:34,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 146 transitions, 834 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-12-06 17:39:34,471 INFO L242 Difference]: Finished difference. Result has 167 places, 129 transitions, 555 flow [2021-12-06 17:39:34,472 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=555, PETRI_PLACES=167, PETRI_TRANSITIONS=129} [2021-12-06 17:39:34,472 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2021-12-06 17:39:34,472 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 129 transitions, 555 flow [2021-12-06 17:39:34,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:34,473 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:34,473 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:34,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:39:34,473 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash 705480537, now seen corresponding path program 4 times [2021-12-06 17:39:34,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:34,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215009841] [2021-12-06 17:39:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:34,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:34,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215009841] [2021-12-06 17:39:34,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215009841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:34,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:34,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:39:34,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146718831] [2021-12-06 17:39:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:34,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:39:34,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:34,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:39:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:39:34,622 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2021-12-06 17:39:34,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 129 transitions, 555 flow. Second operand has 9 states, 9 states have (on average 109.88888888888889) internal successors, (989), 9 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:34,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:34,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2021-12-06 17:39:34,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:35,012 INFO L129 PetriNetUnfolder]: 381/1185 cut-off events. [2021-12-06 17:39:35,013 INFO L130 PetriNetUnfolder]: For 13513/14104 co-relation queries the response was YES. [2021-12-06 17:39:35,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 1185 events. 381/1185 cut-off events. For 13513/14104 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8641 event pairs, 74 based on Foata normal form. 45/1161 useless extension candidates. Maximal degree in co-relation 6240. Up to 281 conditions per place. [2021-12-06 17:39:35,030 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 28 selfloop transitions, 17 changer transitions 19/159 dead transitions. [2021-12-06 17:39:35,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 159 transitions, 1167 flow [2021-12-06 17:39:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:39:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 17:39:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1565 transitions. [2021-12-06 17:39:35,034 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8468614718614719 [2021-12-06 17:39:35,034 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1565 transitions. [2021-12-06 17:39:35,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1565 transitions. [2021-12-06 17:39:35,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:35,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1565 transitions. [2021-12-06 17:39:35,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 111.78571428571429) internal successors, (1565), 14 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,041 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,041 INFO L186 Difference]: Start difference. First operand has 167 places, 129 transitions, 555 flow. Second operand 14 states and 1565 transitions. [2021-12-06 17:39:35,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 159 transitions, 1167 flow [2021-12-06 17:39:35,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 159 transitions, 972 flow, removed 90 selfloop flow, removed 14 redundant places. [2021-12-06 17:39:35,055 INFO L242 Difference]: Finished difference. Result has 170 places, 131 transitions, 600 flow [2021-12-06 17:39:35,055 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=600, PETRI_PLACES=170, PETRI_TRANSITIONS=131} [2021-12-06 17:39:35,056 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 31 predicate places. [2021-12-06 17:39:35,056 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 131 transitions, 600 flow [2021-12-06 17:39:35,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.88888888888889) internal successors, (989), 9 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,057 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:35,057 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:35,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 17:39:35,057 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 875164576, now seen corresponding path program 1 times [2021-12-06 17:39:35,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:35,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643204143] [2021-12-06 17:39:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:35,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:35,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:35,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643204143] [2021-12-06 17:39:35,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643204143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:35,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:35,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 17:39:35,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421905145] [2021-12-06 17:39:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:35,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:39:35,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:39:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:35,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2021-12-06 17:39:35,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 131 transitions, 600 flow. Second operand has 12 states, 12 states have (on average 106.75) internal successors, (1281), 12 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:35,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2021-12-06 17:39:35,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:35,628 INFO L129 PetriNetUnfolder]: 302/1010 cut-off events. [2021-12-06 17:39:35,628 INFO L130 PetriNetUnfolder]: For 8894/9554 co-relation queries the response was YES. [2021-12-06 17:39:35,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 1010 events. 302/1010 cut-off events. For 8894/9554 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6998 event pairs, 88 based on Foata normal form. 24/967 useless extension candidates. Maximal degree in co-relation 4899. Up to 364 conditions per place. [2021-12-06 17:39:35,642 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 33 selfloop transitions, 13 changer transitions 10/148 dead transitions. [2021-12-06 17:39:35,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 148 transitions, 948 flow [2021-12-06 17:39:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:39:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 17:39:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1514 transitions. [2021-12-06 17:39:35,644 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192640692640693 [2021-12-06 17:39:35,644 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1514 transitions. [2021-12-06 17:39:35,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1514 transitions. [2021-12-06 17:39:35,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:35,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1514 transitions. [2021-12-06 17:39:35,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 108.14285714285714) internal successors, (1514), 14 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,649 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,649 INFO L186 Difference]: Start difference. First operand has 170 places, 131 transitions, 600 flow. Second operand 14 states and 1514 transitions. [2021-12-06 17:39:35,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 148 transitions, 948 flow [2021-12-06 17:39:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 148 transitions, 837 flow, removed 45 selfloop flow, removed 12 redundant places. [2021-12-06 17:39:35,660 INFO L242 Difference]: Finished difference. Result has 172 places, 133 transitions, 626 flow [2021-12-06 17:39:35,660 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=626, PETRI_PLACES=172, PETRI_TRANSITIONS=133} [2021-12-06 17:39:35,660 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 33 predicate places. [2021-12-06 17:39:35,660 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 133 transitions, 626 flow [2021-12-06 17:39:35,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.75) internal successors, (1281), 12 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,661 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:35,661 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:35,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 17:39:35,662 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash -267819574, now seen corresponding path program 2 times [2021-12-06 17:39:35,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:35,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011794735] [2021-12-06 17:39:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:35,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:35,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011794735] [2021-12-06 17:39:35,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011794735] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:35,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:35,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 17:39:35,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475757112] [2021-12-06 17:39:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:35,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:39:35,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:39:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:35,864 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 132 [2021-12-06 17:39:35,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 133 transitions, 626 flow. Second operand has 12 states, 12 states have (on average 107.66666666666667) internal successors, (1292), 12 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:35,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:35,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 132 [2021-12-06 17:39:35,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:36,289 INFO L129 PetriNetUnfolder]: 296/1003 cut-off events. [2021-12-06 17:39:36,289 INFO L130 PetriNetUnfolder]: For 8143/8497 co-relation queries the response was YES. [2021-12-06 17:39:36,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 1003 events. 296/1003 cut-off events. For 8143/8497 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6786 event pairs, 69 based on Foata normal form. 38/983 useless extension candidates. Maximal degree in co-relation 4682. Up to 279 conditions per place. [2021-12-06 17:39:36,302 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 33 selfloop transitions, 17 changer transitions 10/153 dead transitions. [2021-12-06 17:39:36,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 153 transitions, 1000 flow [2021-12-06 17:39:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:39:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 17:39:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1533 transitions. [2021-12-06 17:39:36,304 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8295454545454546 [2021-12-06 17:39:36,304 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1533 transitions. [2021-12-06 17:39:36,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1533 transitions. [2021-12-06 17:39:36,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:36,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1533 transitions. [2021-12-06 17:39:36,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 109.5) internal successors, (1533), 14 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:36,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:36,308 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:36,308 INFO L186 Difference]: Start difference. First operand has 172 places, 133 transitions, 626 flow. Second operand 14 states and 1533 transitions. [2021-12-06 17:39:36,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 153 transitions, 1000 flow [2021-12-06 17:39:36,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 153 transitions, 900 flow, removed 39 selfloop flow, removed 12 redundant places. [2021-12-06 17:39:36,319 INFO L242 Difference]: Finished difference. Result has 174 places, 134 transitions, 659 flow [2021-12-06 17:39:36,320 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=659, PETRI_PLACES=174, PETRI_TRANSITIONS=134} [2021-12-06 17:39:36,320 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 35 predicate places. [2021-12-06 17:39:36,320 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 134 transitions, 659 flow [2021-12-06 17:39:36,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.66666666666667) internal successors, (1292), 12 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:36,321 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:36,321 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:36,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:39:36,321 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1579152288, now seen corresponding path program 1 times [2021-12-06 17:39:36,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:36,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031185058] [2021-12-06 17:39:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:36,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:36,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:36,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031185058] [2021-12-06 17:39:36,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031185058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:36,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:36,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:39:36,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299973161] [2021-12-06 17:39:36,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:36,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:36,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:36,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:36,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-06 17:39:36,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 134 transitions, 659 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:36,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:36,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-06 17:39:36,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:37,888 INFO L129 PetriNetUnfolder]: 6182/10868 cut-off events. [2021-12-06 17:39:37,888 INFO L130 PetriNetUnfolder]: For 103911/105168 co-relation queries the response was YES. [2021-12-06 17:39:37,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44796 conditions, 10868 events. 6182/10868 cut-off events. For 103911/105168 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 89374 event pairs, 263 based on Foata normal form. 845/11019 useless extension candidates. Maximal degree in co-relation 44706. Up to 4109 conditions per place. [2021-12-06 17:39:37,992 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 147 selfloop transitions, 18 changer transitions 5/265 dead transitions. [2021-12-06 17:39:37,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 265 transitions, 2359 flow [2021-12-06 17:39:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:39:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 17:39:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1154 transitions. [2021-12-06 17:39:37,994 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8742424242424243 [2021-12-06 17:39:37,994 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1154 transitions. [2021-12-06 17:39:37,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1154 transitions. [2021-12-06 17:39:37,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:37,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1154 transitions. [2021-12-06 17:39:37,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:37,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:37,997 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:37,997 INFO L186 Difference]: Start difference. First operand has 174 places, 134 transitions, 659 flow. Second operand 10 states and 1154 transitions. [2021-12-06 17:39:37,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 265 transitions, 2359 flow [2021-12-06 17:39:38,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 265 transitions, 2133 flow, removed 76 selfloop flow, removed 11 redundant places. [2021-12-06 17:39:38,117 INFO L242 Difference]: Finished difference. Result has 172 places, 150 transitions, 733 flow [2021-12-06 17:39:38,118 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=733, PETRI_PLACES=172, PETRI_TRANSITIONS=150} [2021-12-06 17:39:38,118 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 33 predicate places. [2021-12-06 17:39:38,118 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 150 transitions, 733 flow [2021-12-06 17:39:38,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:38,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:38,118 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:38,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 17:39:38,119 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash -674994608, now seen corresponding path program 1 times [2021-12-06 17:39:38,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:38,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534244531] [2021-12-06 17:39:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:38,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:38,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:38,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534244531] [2021-12-06 17:39:38,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534244531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:38,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:38,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 17:39:38,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495561599] [2021-12-06 17:39:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:38,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 17:39:38,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 17:39:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-06 17:39:38,332 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2021-12-06 17:39:38,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 150 transitions, 733 flow. Second operand has 13 states, 13 states have (on average 106.61538461538461) internal successors, (1386), 13 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:38,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:38,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2021-12-06 17:39:38,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:39,160 INFO L129 PetriNetUnfolder]: 1235/4098 cut-off events. [2021-12-06 17:39:39,160 INFO L130 PetriNetUnfolder]: For 12698/15348 co-relation queries the response was YES. [2021-12-06 17:39:39,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14400 conditions, 4098 events. 1235/4098 cut-off events. For 12698/15348 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 42277 event pairs, 517 based on Foata normal form. 178/3796 useless extension candidates. Maximal degree in co-relation 14304. Up to 1204 conditions per place. [2021-12-06 17:39:39,205 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 39 selfloop transitions, 20 changer transitions 0/167 dead transitions. [2021-12-06 17:39:39,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 167 transitions, 1023 flow [2021-12-06 17:39:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:39:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 17:39:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1514 transitions. [2021-12-06 17:39:39,207 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192640692640693 [2021-12-06 17:39:39,207 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1514 transitions. [2021-12-06 17:39:39,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1514 transitions. [2021-12-06 17:39:39,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:39,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1514 transitions. [2021-12-06 17:39:39,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 108.14285714285714) internal successors, (1514), 14 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:39,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:39,211 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:39,211 INFO L186 Difference]: Start difference. First operand has 172 places, 150 transitions, 733 flow. Second operand 14 states and 1514 transitions. [2021-12-06 17:39:39,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 167 transitions, 1023 flow [2021-12-06 17:39:39,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 167 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 17:39:39,230 INFO L242 Difference]: Finished difference. Result has 191 places, 158 transitions, 916 flow [2021-12-06 17:39:39,230 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=916, PETRI_PLACES=191, PETRI_TRANSITIONS=158} [2021-12-06 17:39:39,230 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 52 predicate places. [2021-12-06 17:39:39,230 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 158 transitions, 916 flow [2021-12-06 17:39:39,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.61538461538461) internal successors, (1386), 13 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:39,231 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:39,231 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:39,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 17:39:39,231 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 866854996, now seen corresponding path program 1 times [2021-12-06 17:39:39,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:39,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971204570] [2021-12-06 17:39:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:39,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:39,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-12-06 17:39:39,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971204570] [2021-12-06 17:39:39,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971204570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:39,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:39,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:39:39,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256983078] [2021-12-06 17:39:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:39,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:39:39,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:39:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:39,305 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-06 17:39:39,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 158 transitions, 916 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:39,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:39,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-06 17:39:39,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:41,342 INFO L129 PetriNetUnfolder]: 6898/13230 cut-off events. [2021-12-06 17:39:41,342 INFO L130 PetriNetUnfolder]: For 99691/100890 co-relation queries the response was YES. [2021-12-06 17:39:41,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61985 conditions, 13230 events. 6898/13230 cut-off events. For 99691/100890 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 123068 event pairs, 154 based on Foata normal form. 1114/13835 useless extension candidates. Maximal degree in co-relation 61884. Up to 4386 conditions per place. [2021-12-06 17:39:41,465 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 172 selfloop transitions, 34 changer transitions 34/335 dead transitions. [2021-12-06 17:39:41,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 335 transitions, 3388 flow [2021-12-06 17:39:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:39:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 17:39:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1501 transitions. [2021-12-06 17:39:41,467 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8747086247086248 [2021-12-06 17:39:41,467 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1501 transitions. [2021-12-06 17:39:41,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1501 transitions. [2021-12-06 17:39:41,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:41,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1501 transitions. [2021-12-06 17:39:41,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.46153846153847) internal successors, (1501), 13 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,470 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,471 INFO L186 Difference]: Start difference. First operand has 191 places, 158 transitions, 916 flow. Second operand 13 states and 1501 transitions. [2021-12-06 17:39:41,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 335 transitions, 3388 flow [2021-12-06 17:39:41,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 335 transitions, 3239 flow, removed 54 selfloop flow, removed 5 redundant places. [2021-12-06 17:39:41,555 INFO L242 Difference]: Finished difference. Result has 204 places, 168 transitions, 1023 flow [2021-12-06 17:39:41,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1023, PETRI_PLACES=204, PETRI_TRANSITIONS=168} [2021-12-06 17:39:41,555 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 65 predicate places. [2021-12-06 17:39:41,555 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 168 transitions, 1023 flow [2021-12-06 17:39:41,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:41,556 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 17:39:41,556 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1667743411, now seen corresponding path program 1 times [2021-12-06 17:39:41,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743018005] [2021-12-06 17:39:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743018005] [2021-12-06 17:39:41,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743018005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:39:41,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829449430] [2021-12-06 17:39:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:41,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:41,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-12-06 17:39:41,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 168 transitions, 1023 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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-12-06 17:39:41,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:41,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-12-06 17:39:41,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:43,123 INFO L129 PetriNetUnfolder]: 2388/9253 cut-off events. [2021-12-06 17:39:43,123 INFO L130 PetriNetUnfolder]: For 41917/51964 co-relation queries the response was YES. [2021-12-06 17:39:43,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36921 conditions, 9253 events. 2388/9253 cut-off events. For 41917/51964 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 119512 event pairs, 302 based on Foata normal form. 243/8869 useless extension candidates. Maximal degree in co-relation 36816. Up to 2873 conditions per place. [2021-12-06 17:39:43,218 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 68 selfloop transitions, 11 changer transitions 9/219 dead transitions. [2021-12-06 17:39:43,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 219 transitions, 1801 flow [2021-12-06 17:39:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:39:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 17:39:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1037 transitions. [2021-12-06 17:39:43,220 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.872895622895623 [2021-12-06 17:39:43,220 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1037 transitions. [2021-12-06 17:39:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1037 transitions. [2021-12-06 17:39:43,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:43,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1037 transitions. [2021-12-06 17:39:43,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,222 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,222 INFO L186 Difference]: Start difference. First operand has 204 places, 168 transitions, 1023 flow. Second operand 9 states and 1037 transitions. [2021-12-06 17:39:43,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 219 transitions, 1801 flow [2021-12-06 17:39:43,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 219 transitions, 1672 flow, removed 56 selfloop flow, removed 10 redundant places. [2021-12-06 17:39:43,578 INFO L242 Difference]: Finished difference. Result has 203 places, 176 transitions, 1065 flow [2021-12-06 17:39:43,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1065, PETRI_PLACES=203, PETRI_TRANSITIONS=176} [2021-12-06 17:39:43,579 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 64 predicate places. [2021-12-06 17:39:43,579 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 176 transitions, 1065 flow [2021-12-06 17:39:43,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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-12-06 17:39:43,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:43,579 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:43,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:39:43,579 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1879907041, now seen corresponding path program 1 times [2021-12-06 17:39:43,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:43,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894149158] [2021-12-06 17:39:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:43,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:43,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:43,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894149158] [2021-12-06 17:39:43,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894149158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:43,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:43,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:39:43,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436437679] [2021-12-06 17:39:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:43,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:39:43,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:43,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:39:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:39:43,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-06 17:39:43,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 176 transitions, 1065 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:43,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-06 17:39:43,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:46,734 INFO L129 PetriNetUnfolder]: 9157/17992 cut-off events. [2021-12-06 17:39:46,734 INFO L130 PetriNetUnfolder]: For 160830/162829 co-relation queries the response was YES. [2021-12-06 17:39:46,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92245 conditions, 17992 events. 9157/17992 cut-off events. For 160830/162829 co-relation queries the response was YES. Maximal size of possible extension queue 1721. Compared 185338 event pairs, 44 based on Foata normal form. 1587/18888 useless extension candidates. Maximal degree in co-relation 92140. Up to 4481 conditions per place. [2021-12-06 17:39:46,932 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 74 selfloop transitions, 15 changer transitions 174/358 dead transitions. [2021-12-06 17:39:46,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 358 transitions, 3759 flow [2021-12-06 17:39:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:39:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 17:39:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1847 transitions. [2021-12-06 17:39:46,936 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8745265151515151 [2021-12-06 17:39:46,936 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1847 transitions. [2021-12-06 17:39:46,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1847 transitions. [2021-12-06 17:39:46,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:46,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1847 transitions. [2021-12-06 17:39:46,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.4375) internal successors, (1847), 16 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:46,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:46,943 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:46,943 INFO L186 Difference]: Start difference. First operand has 203 places, 176 transitions, 1065 flow. Second operand 16 states and 1847 transitions. [2021-12-06 17:39:46,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 358 transitions, 3759 flow [2021-12-06 17:39:47,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 358 transitions, 3622 flow, removed 21 selfloop flow, removed 4 redundant places. [2021-12-06 17:39:47,725 INFO L242 Difference]: Finished difference. Result has 220 places, 137 transitions, 786 flow [2021-12-06 17:39:47,725 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=786, PETRI_PLACES=220, PETRI_TRANSITIONS=137} [2021-12-06 17:39:47,726 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 81 predicate places. [2021-12-06 17:39:47,726 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 137 transitions, 786 flow [2021-12-06 17:39:47,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:47,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:47,726 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:47,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 17:39:47,726 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1446073488, now seen corresponding path program 1 times [2021-12-06 17:39:47,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:47,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807641694] [2021-12-06 17:39:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:47,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:47,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:47,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807641694] [2021-12-06 17:39:47,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807641694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:47,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:47,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:39:47,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709899274] [2021-12-06 17:39:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:47,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:39:47,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:39:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:39:47,872 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-12-06 17:39:47,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 137 transitions, 786 flow. Second operand has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:47,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:47,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-12-06 17:39:47,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:48,372 INFO L129 PetriNetUnfolder]: 831/2366 cut-off events. [2021-12-06 17:39:48,372 INFO L130 PetriNetUnfolder]: For 20501/20566 co-relation queries the response was YES. [2021-12-06 17:39:48,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11832 conditions, 2366 events. 831/2366 cut-off events. For 20501/20566 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19770 event pairs, 9 based on Foata normal form. 115/2376 useless extension candidates. Maximal degree in co-relation 11775. Up to 633 conditions per place. [2021-12-06 17:39:48,389 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 57 selfloop transitions, 19 changer transitions 34/202 dead transitions. [2021-12-06 17:39:48,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 202 transitions, 1789 flow [2021-12-06 17:39:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:39:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 17:39:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1354 transitions. [2021-12-06 17:39:48,391 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8547979797979798 [2021-12-06 17:39:48,391 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1354 transitions. [2021-12-06 17:39:48,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1354 transitions. [2021-12-06 17:39:48,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:48,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1354 transitions. [2021-12-06 17:39:48,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.83333333333333) internal successors, (1354), 12 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,394 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,394 INFO L186 Difference]: Start difference. First operand has 220 places, 137 transitions, 786 flow. Second operand 12 states and 1354 transitions. [2021-12-06 17:39:48,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 202 transitions, 1789 flow [2021-12-06 17:39:48,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 202 transitions, 1343 flow, removed 150 selfloop flow, removed 37 redundant places. [2021-12-06 17:39:48,449 INFO L242 Difference]: Finished difference. Result has 174 places, 133 transitions, 574 flow [2021-12-06 17:39:48,449 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=574, PETRI_PLACES=174, PETRI_TRANSITIONS=133} [2021-12-06 17:39:48,450 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 35 predicate places. [2021-12-06 17:39:48,450 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 133 transitions, 574 flow [2021-12-06 17:39:48,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,450 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:48,450 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:48,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 17:39:48,451 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1215795474, now seen corresponding path program 1 times [2021-12-06 17:39:48,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:48,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159882208] [2021-12-06 17:39:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:48,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:48,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:48,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159882208] [2021-12-06 17:39:48,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159882208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:48,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:48,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 17:39:48,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84914053] [2021-12-06 17:39:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:48,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:39:48,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:48,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:39:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:48,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2021-12-06 17:39:48,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 133 transitions, 574 flow. Second operand has 12 states, 12 states have (on average 105.91666666666667) internal successors, (1271), 12 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 17:39:48,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2021-12-06 17:39:48,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 17:39:48,866 INFO L129 PetriNetUnfolder]: 185/861 cut-off events. [2021-12-06 17:39:48,866 INFO L130 PetriNetUnfolder]: For 1405/1539 co-relation queries the response was YES. [2021-12-06 17:39:48,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 861 events. 185/861 cut-off events. For 1405/1539 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5834 event pairs, 5 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 2311. Up to 139 conditions per place. [2021-12-06 17:39:48,871 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 20 selfloop transitions, 5 changer transitions 47/170 dead transitions. [2021-12-06 17:39:48,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 170 transitions, 1013 flow [2021-12-06 17:39:48,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:39:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 17:39:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1296 transitions. [2021-12-06 17:39:48,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-12-06 17:39:48,873 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1296 transitions. [2021-12-06 17:39:48,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1296 transitions. [2021-12-06 17:39:48,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:39:48,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1296 transitions. [2021-12-06 17:39:48,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,876 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,876 INFO L186 Difference]: Start difference. First operand has 174 places, 133 transitions, 574 flow. Second operand 12 states and 1296 transitions. [2021-12-06 17:39:48,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 170 transitions, 1013 flow [2021-12-06 17:39:48,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 170 transitions, 750 flow, removed 69 selfloop flow, removed 27 redundant places. [2021-12-06 17:39:48,883 INFO L242 Difference]: Finished difference. Result has 159 places, 123 transitions, 350 flow [2021-12-06 17:39:48,883 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=159, PETRI_TRANSITIONS=123} [2021-12-06 17:39:48,884 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 20 predicate places. [2021-12-06 17:39:48,884 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 123 transitions, 350 flow [2021-12-06 17:39:48,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 105.91666666666667) internal successors, (1271), 12 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,884 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 17:39:48,884 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:48,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 17:39:48,884 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 17:39:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1166035788, now seen corresponding path program 2 times [2021-12-06 17:39:48,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932039688] [2021-12-06 17:39:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:48,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:39:48,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:39:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:39:49,005 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:39:49,005 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:39:49,006 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-06 17:39:49,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-06 17:39:49,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-06 17:39:49,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-06 17:39:49,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-06 17:39:49,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-06 17:39:49,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-06 17:39:49,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 17:39:49,011 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:49,015 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 17:39:49,015 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:39:49,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:39:49 BasicIcfg [2021-12-06 17:39:49,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:39:49,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:39:49,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:39:49,142 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:39:49,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:28" (3/4) ... [2021-12-06 17:39:49,143 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 17:39:49,246 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 17:39:49,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:39:49,247 INFO L158 Benchmark]: Toolchain (without parser) took 21681.62ms. Allocated memory was 75.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 36.6MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-12-06 17:39:49,247 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 75.5MB. Free memory is still 54.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:39:49,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.33ms. Allocated memory was 75.5MB in the beginning and 125.8MB in the end (delta: 50.3MB). Free memory was 36.3MB in the beginning and 91.2MB in the end (delta: -54.9MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2021-12-06 17:39:49,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.01ms. Allocated memory is still 125.8MB. Free memory was 91.2MB in the beginning and 88.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:39:49,248 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:39:49,248 INFO L158 Benchmark]: RCFGBuilder took 779.09ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 60.1MB in the end (delta: 25.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-06 17:39:49,249 INFO L158 Benchmark]: TraceAbstraction took 20321.71ms. Allocated memory was 125.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 60.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-12-06 17:39:49,249 INFO L158 Benchmark]: Witness Printer took 104.55ms. Allocated memory is still 2.8GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-06 17:39:49,251 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.12ms. Allocated memory is still 75.5MB. Free memory is still 54.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.33ms. Allocated memory was 75.5MB in the beginning and 125.8MB in the end (delta: 50.3MB). Free memory was 36.3MB in the beginning and 91.2MB in the end (delta: -54.9MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.01ms. Allocated memory is still 125.8MB. Free memory was 91.2MB in the beginning and 88.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 125.8MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 779.09ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 60.1MB in the end (delta: 25.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20321.71ms. Allocated memory was 125.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 60.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 104.55ms. Allocated memory is still 2.8GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t1517; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 835]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 942 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1512 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2554 IncrementalHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 175 mSDtfsCounter, 2554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1065occurred in iteration=16, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1684 ConstructedInterpolants, 0 QuantifiedInterpolants, 9134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-12-06 17:39:49,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f03045c-238e-4ee9-ba42-012ed5c9611d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE