./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:23:22,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:23:22,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:23:22,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:23:22,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:23:22,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:23:22,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:23:22,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:23:22,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:23:22,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:23:22,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:23:22,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:23:22,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:23:22,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:23:22,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:23:22,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:23:22,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:23:23,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:23:23,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:23:23,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:23:23,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:23:23,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:23:23,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:23:23,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:23:23,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:23:23,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:23:23,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:23:23,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:23:23,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:23:23,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:23:23,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:23:23,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:23:23,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:23:23,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:23:23,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:23:23,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:23:23,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:23:23,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:23:23,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:23:23,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:23:23,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:23:23,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 08:23:23,122 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:23:23,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:23:23,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:23:23,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:23:23,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:23:23,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:23:23,138 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:23:23,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:23:23,139 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:23:23,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:23:23,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:23:23,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:23:23,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:23:23,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:23:23,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:23:23,142 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:23:23,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:23:23,143 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:23:23,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:23:23,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:23:23,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:23:23,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:23:23,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:23:23,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:23:23,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:23:23,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:23:23,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:23:23,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:23:23,147 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:23:23,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:23:23,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:23:23,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:23:23,148 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_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/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_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2021-11-07 08:23:23,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:23:23,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:23:23,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:23:23,570 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:23:23,571 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:23:23,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-11-07 08:23:23,688 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/data/029a6f1ec/8d219e6e42ca4c5891ae0b48bfb70ab3/FLAG10b0a9f0b [2021-11-07 08:23:24,506 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:23:24,507 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-11-07 08:23:24,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/data/029a6f1ec/8d219e6e42ca4c5891ae0b48bfb70ab3/FLAG10b0a9f0b [2021-11-07 08:23:24,719 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/data/029a6f1ec/8d219e6e42ca4c5891ae0b48bfb70ab3 [2021-11-07 08:23:24,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:23:24,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:23:24,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:23:24,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:23:24,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:23:24,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:23:24" (1/1) ... [2021-11-07 08:23:24,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2162b52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:24, skipping insertion in model container [2021-11-07 08:23:24,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:23:24" (1/1) ... [2021-11-07 08:23:24,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:23:24,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:23:25,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-11-07 08:23:25,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:23:25,524 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:23:25,545 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-11-07 08:23:25,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:23:25,735 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:23:25,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25 WrapperNode [2021-11-07 08:23:25,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:23:25,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:23:25,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:23:25,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:23:25,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:23:25,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:23:25,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:23:25,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:23:25,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:23:25,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:23:25,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:23:25,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:23:25,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (1/1) ... [2021-11-07 08:23:25,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:23:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:23:26,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:23:26,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:23:26,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:23:26,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-07 08:23:26,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:23:26,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:23:26,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-07 08:23:26,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-07 08:23:26,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-07 08:23:26,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-07 08:23:26,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:23:26,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-07 08:23:26,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:23:26,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:23:26,110 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-07 08:23:28,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:23:28,549 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-07 08:23:28,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:23:28 BoogieIcfgContainer [2021-11-07 08:23:28,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:23:28,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:23:28,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:23:28,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:23:28,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:23:24" (1/3) ... [2021-11-07 08:23:28,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719b578e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:23:28, skipping insertion in model container [2021-11-07 08:23:28,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:23:25" (2/3) ... [2021-11-07 08:23:28,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719b578e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:23:28, skipping insertion in model container [2021-11-07 08:23:28,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:23:28" (3/3) ... [2021-11-07 08:23:28,564 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2021-11-07 08:23:28,571 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 08:23:28,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:23:28,571 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 08:23:28,571 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 08:23:28,617 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,617 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,617 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,617 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,618 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,618 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,618 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,618 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,619 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,619 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,619 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,619 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,619 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,620 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,620 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,620 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,623 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,623 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,624 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,625 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,625 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,625 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,627 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,627 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,627 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,628 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,629 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,629 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,629 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,630 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,630 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,631 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,634 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,634 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,635 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,635 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,635 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,636 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,636 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,637 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,637 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,653 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,653 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,653 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,653 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,654 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,654 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,654 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,654 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,660 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,661 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 08:23:28,662 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-07 08:23:28,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:23:28,758 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-11-07 08:23:28,765 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-07 08:23:28,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-11-07 08:23:28,831 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-11-07 08:23:28,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 08:23:28,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-11-07 08:23:28,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-11-07 08:23:28,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-11-07 08:23:28,859 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-11-07 08:23:28,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 08:23:28,860 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:28,861 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:28,861 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash -983988078, now seen corresponding path program 1 times [2021-11-07 08:23:28,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:28,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164073270] [2021-11-07 08:23:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:28,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:29,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:29,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164073270] [2021-11-07 08:23:29,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164073270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:29,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:29,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:23:29,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628380042] [2021-11-07 08:23:29,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:23:29,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:23:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:23:29,379 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-11-07 08:23:29,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:29,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:29,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-11-07 08:23:29,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:29,589 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2021-11-07 08:23:29,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 08:23:29,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 185 events. 16/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 597 event pairs, 6 based on Foata normal form. 9/183 useless extension candidates. Maximal degree in co-relation 185. Up to 27 conditions per place. [2021-11-07 08:23:29,598 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-11-07 08:23:29,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-11-07 08:23:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:23:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-07 08:23:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-11-07 08:23:29,622 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-11-07 08:23:29,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-11-07 08:23:29,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-11-07 08:23:29,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:29,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-11-07 08:23:29,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:29,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:29,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:29,655 INFO L186 Difference]: Start difference. First operand has 88 places, 83 transitions, 172 flow. Second operand 3 states and 239 transitions. [2021-11-07 08:23:29,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 188 flow [2021-11-07 08:23:29,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-07 08:23:29,673 INFO L242 Difference]: Finished difference. Result has 86 places, 79 transitions, 166 flow [2021-11-07 08:23:29,676 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2021-11-07 08:23:29,677 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, -2 predicate places. [2021-11-07 08:23:29,677 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 166 flow [2021-11-07 08:23:29,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:29,679 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:29,679 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:29,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:23:29,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -260033218, now seen corresponding path program 1 times [2021-11-07 08:23:29,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:29,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880142522] [2021-11-07 08:23:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:29,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:30,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:30,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880142522] [2021-11-07 08:23:30,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880142522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:30,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:30,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:23:30,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342257704] [2021-11-07 08:23:30,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:23:30,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:30,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:23:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:23:30,132 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-07 08:23:30,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:30,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:30,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-07 08:23:30,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:30,401 INFO L129 PetriNetUnfolder]: 30/236 cut-off events. [2021-11-07 08:23:30,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 08:23:30,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 236 events. 30/236 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 993 event pairs, 6 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 275. Up to 36 conditions per place. [2021-11-07 08:23:30,408 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 8 selfloop transitions, 3 changer transitions 29/102 dead transitions. [2021-11-07 08:23:30,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 278 flow [2021-11-07 08:23:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 08:23:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-07 08:23:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-11-07 08:23:30,420 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-11-07 08:23:30,420 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-11-07 08:23:30,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-11-07 08:23:30,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:30,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-11-07 08:23:30,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:30,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:30,435 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:30,435 INFO L186 Difference]: Start difference. First operand has 86 places, 79 transitions, 166 flow. Second operand 9 states and 683 transitions. [2021-11-07 08:23:30,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 278 flow [2021-11-07 08:23:30,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 102 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-07 08:23:30,444 INFO L242 Difference]: Finished difference. Result has 99 places, 73 transitions, 189 flow [2021-11-07 08:23:30,444 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2021-11-07 08:23:30,445 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2021-11-07 08:23:30,445 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 189 flow [2021-11-07 08:23:30,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:30,446 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:30,447 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:30,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:23:30,447 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash -81606177, now seen corresponding path program 1 times [2021-11-07 08:23:30,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:30,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149552383] [2021-11-07 08:23:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:30,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:31,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:31,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149552383] [2021-11-07 08:23:31,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149552383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:31,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:31,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:23:31,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425511483] [2021-11-07 08:23:31,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:23:31,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:31,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:23:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:23:31,067 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-11-07 08:23:31,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 189 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:31,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:31,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-11-07 08:23:31,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:31,648 INFO L129 PetriNetUnfolder]: 138/390 cut-off events. [2021-11-07 08:23:31,648 INFO L130 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2021-11-07 08:23:31,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 390 events. 138/390 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1792 event pairs, 59 based on Foata normal form. 14/395 useless extension candidates. Maximal degree in co-relation 854. Up to 129 conditions per place. [2021-11-07 08:23:31,655 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 13 selfloop transitions, 9 changer transitions 35/114 dead transitions. [2021-11-07 08:23:31,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 114 transitions, 413 flow [2021-11-07 08:23:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 08:23:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-07 08:23:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1084 transitions. [2021-11-07 08:23:31,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7970588235294118 [2021-11-07 08:23:31,668 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1084 transitions. [2021-11-07 08:23:31,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1084 transitions. [2021-11-07 08:23:31,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:31,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1084 transitions. [2021-11-07 08:23:31,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 67.75) internal successors, (1084), 16 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:31,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:31,683 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:31,684 INFO L186 Difference]: Start difference. First operand has 99 places, 73 transitions, 189 flow. Second operand 16 states and 1084 transitions. [2021-11-07 08:23:31,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 114 transitions, 413 flow [2021-11-07 08:23:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 114 transitions, 392 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-11-07 08:23:31,731 INFO L242 Difference]: Finished difference. Result has 107 places, 77 transitions, 254 flow [2021-11-07 08:23:31,732 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=254, PETRI_PLACES=107, PETRI_TRANSITIONS=77} [2021-11-07 08:23:31,732 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2021-11-07 08:23:31,733 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 77 transitions, 254 flow [2021-11-07 08:23:31,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:31,733 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:31,734 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:31,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:23:31,734 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:31,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 581602826, now seen corresponding path program 1 times [2021-11-07 08:23:31,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:31,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879981439] [2021-11-07 08:23:31,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:31,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:32,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:32,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879981439] [2021-11-07 08:23:32,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879981439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:32,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:32,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:23:32,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475329682] [2021-11-07 08:23:32,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:23:32,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:23:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:23:32,064 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-11-07 08:23:32,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 77 transitions, 254 flow. Second operand has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:32,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:32,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-11-07 08:23:32,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:32,624 INFO L129 PetriNetUnfolder]: 102/364 cut-off events. [2021-11-07 08:23:32,624 INFO L130 PetriNetUnfolder]: For 1027/1030 co-relation queries the response was YES. [2021-11-07 08:23:32,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 364 events. 102/364 cut-off events. For 1027/1030 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1736 event pairs, 6 based on Foata normal form. 9/364 useless extension candidates. Maximal degree in co-relation 1060. Up to 106 conditions per place. [2021-11-07 08:23:32,632 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 20 selfloop transitions, 7 changer transitions 25/112 dead transitions. [2021-11-07 08:23:32,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 592 flow [2021-11-07 08:23:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 08:23:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-07 08:23:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 923 transitions. [2021-11-07 08:23:32,640 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2021-11-07 08:23:32,640 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 923 transitions. [2021-11-07 08:23:32,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 923 transitions. [2021-11-07 08:23:32,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:32,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 923 transitions. [2021-11-07 08:23:32,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.0) internal successors, (923), 13 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:32,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:32,653 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:32,654 INFO L186 Difference]: Start difference. First operand has 107 places, 77 transitions, 254 flow. Second operand 13 states and 923 transitions. [2021-11-07 08:23:32,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 592 flow [2021-11-07 08:23:32,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 562 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-11-07 08:23:32,696 INFO L242 Difference]: Finished difference. Result has 114 places, 80 transitions, 304 flow [2021-11-07 08:23:32,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=304, PETRI_PLACES=114, PETRI_TRANSITIONS=80} [2021-11-07 08:23:32,696 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2021-11-07 08:23:32,697 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 80 transitions, 304 flow [2021-11-07 08:23:32,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:32,698 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:32,698 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:32,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:23:32,699 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1565276866, now seen corresponding path program 2 times [2021-11-07 08:23:32,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:32,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293365682] [2021-11-07 08:23:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:32,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:33,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:33,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293365682] [2021-11-07 08:23:33,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293365682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:33,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:33,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 08:23:33,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38391680] [2021-11-07 08:23:33,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 08:23:33,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 08:23:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:23:33,025 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-11-07 08:23:33,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 80 transitions, 304 flow. Second operand has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:33,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-11-07 08:23:33,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:33,460 INFO L129 PetriNetUnfolder]: 93/290 cut-off events. [2021-11-07 08:23:33,461 INFO L130 PetriNetUnfolder]: For 1583/1619 co-relation queries the response was YES. [2021-11-07 08:23:33,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 290 events. 93/290 cut-off events. For 1583/1619 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1097 event pairs, 22 based on Foata normal form. 13/297 useless extension candidates. Maximal degree in co-relation 1150. Up to 101 conditions per place. [2021-11-07 08:23:33,467 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 18 selfloop transitions, 7 changer transitions 19/102 dead transitions. [2021-11-07 08:23:33,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 102 transitions, 606 flow [2021-11-07 08:23:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:23:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-07 08:23:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 821 transitions. [2021-11-07 08:23:33,473 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8049019607843138 [2021-11-07 08:23:33,473 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 821 transitions. [2021-11-07 08:23:33,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 821 transitions. [2021-11-07 08:23:33,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:33,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 821 transitions. [2021-11-07 08:23:33,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 68.41666666666667) internal successors, (821), 12 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,482 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,482 INFO L186 Difference]: Start difference. First operand has 114 places, 80 transitions, 304 flow. Second operand 12 states and 821 transitions. [2021-11-07 08:23:33,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 102 transitions, 606 flow [2021-11-07 08:23:33,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 555 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-11-07 08:23:33,495 INFO L242 Difference]: Finished difference. Result has 116 places, 80 transitions, 309 flow [2021-11-07 08:23:33,496 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=309, PETRI_PLACES=116, PETRI_TRANSITIONS=80} [2021-11-07 08:23:33,496 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-11-07 08:23:33,496 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 80 transitions, 309 flow [2021-11-07 08:23:33,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,497 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:33,497 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:33,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:23:33,498 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 149924735, now seen corresponding path program 1 times [2021-11-07 08:23:33,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:33,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505765269] [2021-11-07 08:23:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:33,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:33,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:33,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505765269] [2021-11-07 08:23:33,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505765269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:33,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:33,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:23:33,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670858790] [2021-11-07 08:23:33,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:23:33,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:23:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:23:33,671 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-07 08:23:33,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 80 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:33,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-07 08:23:33,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:33,899 INFO L129 PetriNetUnfolder]: 60/316 cut-off events. [2021-11-07 08:23:33,899 INFO L130 PetriNetUnfolder]: For 1616/1656 co-relation queries the response was YES. [2021-11-07 08:23:33,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 316 events. 60/316 cut-off events. For 1616/1656 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1598 event pairs, 25 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 1099. Up to 49 conditions per place. [2021-11-07 08:23:33,906 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 13 selfloop transitions, 6 changer transitions 6/94 dead transitions. [2021-11-07 08:23:33,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 94 transitions, 505 flow [2021-11-07 08:23:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 08:23:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-07 08:23:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 674 transitions. [2021-11-07 08:23:33,910 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810457516339869 [2021-11-07 08:23:33,911 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 674 transitions. [2021-11-07 08:23:33,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 674 transitions. [2021-11-07 08:23:33,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:33,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 674 transitions. [2021-11-07 08:23:33,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.88888888888889) internal successors, (674), 9 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,918 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,918 INFO L186 Difference]: Start difference. First operand has 116 places, 80 transitions, 309 flow. Second operand 9 states and 674 transitions. [2021-11-07 08:23:33,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 94 transitions, 505 flow [2021-11-07 08:23:33,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 94 transitions, 420 flow, removed 37 selfloop flow, removed 13 redundant places. [2021-11-07 08:23:33,929 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 335 flow [2021-11-07 08:23:33,930 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=335, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2021-11-07 08:23:33,930 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 24 predicate places. [2021-11-07 08:23:33,930 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 335 flow [2021-11-07 08:23:33,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:33,931 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:33,931 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:33,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:23:33,932 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash -857863622, now seen corresponding path program 1 times [2021-11-07 08:23:33,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:33,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728259820] [2021-11-07 08:23:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:33,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:34,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:34,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728259820] [2021-11-07 08:23:34,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728259820] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:34,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:34,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 08:23:34,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505009837] [2021-11-07 08:23:34,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 08:23:34,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 08:23:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:23:34,403 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-11-07 08:23:34,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 335 flow. Second operand has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:34,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:34,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-11-07 08:23:34,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:34,838 INFO L129 PetriNetUnfolder]: 136/429 cut-off events. [2021-11-07 08:23:34,839 INFO L130 PetriNetUnfolder]: For 2158/2231 co-relation queries the response was YES. [2021-11-07 08:23:34,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 429 events. 136/429 cut-off events. For 2158/2231 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2139 event pairs, 58 based on Foata normal form. 13/428 useless extension candidates. Maximal degree in co-relation 1723. Up to 194 conditions per place. [2021-11-07 08:23:34,847 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 16 selfloop transitions, 11 changer transitions 17/101 dead transitions. [2021-11-07 08:23:34,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 101 transitions, 601 flow [2021-11-07 08:23:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:23:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-07 08:23:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 676 transitions. [2021-11-07 08:23:34,852 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7952941176470588 [2021-11-07 08:23:34,853 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 676 transitions. [2021-11-07 08:23:34,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 676 transitions. [2021-11-07 08:23:34,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:34,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 676 transitions. [2021-11-07 08:23:34,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 67.6) internal successors, (676), 10 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:34,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:34,861 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:34,861 INFO L186 Difference]: Start difference. First operand has 112 places, 83 transitions, 335 flow. Second operand 10 states and 676 transitions. [2021-11-07 08:23:34,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 101 transitions, 601 flow [2021-11-07 08:23:34,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 101 transitions, 566 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-11-07 08:23:34,876 INFO L242 Difference]: Finished difference. Result has 118 places, 82 transitions, 337 flow [2021-11-07 08:23:34,877 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=337, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2021-11-07 08:23:34,877 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 30 predicate places. [2021-11-07 08:23:34,877 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 337 flow [2021-11-07 08:23:34,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:34,878 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:34,879 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:34,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:23:34,879 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash -191210822, now seen corresponding path program 2 times [2021-11-07 08:23:34,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:34,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761045965] [2021-11-07 08:23:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:34,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:35,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:35,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761045965] [2021-11-07 08:23:35,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761045965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:35,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:35,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:23:35,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951804465] [2021-11-07 08:23:35,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:23:35,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:35,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:23:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:23:35,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-11-07 08:23:35,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 337 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:35,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:35,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-11-07 08:23:35,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:35,661 INFO L129 PetriNetUnfolder]: 102/358 cut-off events. [2021-11-07 08:23:35,661 INFO L130 PetriNetUnfolder]: For 1944/2070 co-relation queries the response was YES. [2021-11-07 08:23:35,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 358 events. 102/358 cut-off events. For 1944/2070 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1653 event pairs, 41 based on Foata normal form. 17/363 useless extension candidates. Maximal degree in co-relation 1438. Up to 149 conditions per place. [2021-11-07 08:23:35,669 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 18 selfloop transitions, 11 changer transitions 20/105 dead transitions. [2021-11-07 08:23:35,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 105 transitions, 689 flow [2021-11-07 08:23:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 08:23:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-07 08:23:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 866 transitions. [2021-11-07 08:23:35,677 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.783710407239819 [2021-11-07 08:23:35,677 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 866 transitions. [2021-11-07 08:23:35,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 866 transitions. [2021-11-07 08:23:35,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:35,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 866 transitions. [2021-11-07 08:23:35,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:35,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:35,688 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:35,688 INFO L186 Difference]: Start difference. First operand has 118 places, 82 transitions, 337 flow. Second operand 13 states and 866 transitions. [2021-11-07 08:23:35,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 105 transitions, 689 flow [2021-11-07 08:23:35,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 628 flow, removed 21 selfloop flow, removed 11 redundant places. [2021-11-07 08:23:35,703 INFO L242 Difference]: Finished difference. Result has 120 places, 83 transitions, 359 flow [2021-11-07 08:23:35,704 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=359, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2021-11-07 08:23:35,704 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-11-07 08:23:35,704 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 359 flow [2021-11-07 08:23:35,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:35,705 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:35,705 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:35,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:23:35,706 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1829531136, now seen corresponding path program 3 times [2021-11-07 08:23:35,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:35,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86221098] [2021-11-07 08:23:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:35,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:35,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:35,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86221098] [2021-11-07 08:23:35,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86221098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:35,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:35,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:23:35,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692388535] [2021-11-07 08:23:35,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:23:35,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:23:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:23:35,975 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-11-07 08:23:35,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 359 flow. Second operand has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:35,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:35,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-11-07 08:23:35,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:36,391 INFO L129 PetriNetUnfolder]: 102/353 cut-off events. [2021-11-07 08:23:36,392 INFO L130 PetriNetUnfolder]: For 3632/3755 co-relation queries the response was YES. [2021-11-07 08:23:36,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 353 events. 102/353 cut-off events. For 3632/3755 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1612 event pairs, 42 based on Foata normal form. 17/358 useless extension candidates. Maximal degree in co-relation 1771. Up to 150 conditions per place. [2021-11-07 08:23:36,400 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 17 selfloop transitions, 13 changer transitions 11/98 dead transitions. [2021-11-07 08:23:36,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 98 transitions, 678 flow [2021-11-07 08:23:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:23:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-07 08:23:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 675 transitions. [2021-11-07 08:23:36,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2021-11-07 08:23:36,406 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 675 transitions. [2021-11-07 08:23:36,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 675 transitions. [2021-11-07 08:23:36,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:36,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 675 transitions. [2021-11-07 08:23:36,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 67.5) internal successors, (675), 10 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:36,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:36,414 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:36,414 INFO L186 Difference]: Start difference. First operand has 120 places, 83 transitions, 359 flow. Second operand 10 states and 675 transitions. [2021-11-07 08:23:36,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 98 transitions, 678 flow [2021-11-07 08:23:36,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 98 transitions, 599 flow, removed 29 selfloop flow, removed 11 redundant places. [2021-11-07 08:23:36,428 INFO L242 Difference]: Finished difference. Result has 116 places, 86 transitions, 402 flow [2021-11-07 08:23:36,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=116, PETRI_TRANSITIONS=86} [2021-11-07 08:23:36,429 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-11-07 08:23:36,430 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 86 transitions, 402 flow [2021-11-07 08:23:36,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:36,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:36,431 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:36,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:23:36,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1961170440, now seen corresponding path program 4 times [2021-11-07 08:23:36,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:36,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513639005] [2021-11-07 08:23:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:36,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:36,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:36,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513639005] [2021-11-07 08:23:36,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513639005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:36,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:36,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 08:23:36,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543268096] [2021-11-07 08:23:36,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 08:23:36,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 08:23:36,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:23:36,747 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-11-07 08:23:36,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 86 transitions, 402 flow. Second operand has 10 states, 10 states have (on average 66.3) internal successors, (663), 10 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:36,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:36,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-11-07 08:23:36,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:37,571 INFO L129 PetriNetUnfolder]: 100/386 cut-off events. [2021-11-07 08:23:37,572 INFO L130 PetriNetUnfolder]: For 3498/3665 co-relation queries the response was YES. [2021-11-07 08:23:37,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 386 events. 100/386 cut-off events. For 3498/3665 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1991 event pairs, 24 based on Foata normal form. 26/397 useless extension candidates. Maximal degree in co-relation 1812. Up to 118 conditions per place. [2021-11-07 08:23:37,579 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 19 selfloop transitions, 14 changer transitions 23/114 dead transitions. [2021-11-07 08:23:37,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 894 flow [2021-11-07 08:23:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 08:23:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-07 08:23:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 958 transitions. [2021-11-07 08:23:37,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8050420168067227 [2021-11-07 08:23:37,585 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 958 transitions. [2021-11-07 08:23:37,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 958 transitions. [2021-11-07 08:23:37,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:37,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 958 transitions. [2021-11-07 08:23:37,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 68.42857142857143) internal successors, (958), 14 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:37,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:37,596 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:37,596 INFO L186 Difference]: Start difference. First operand has 116 places, 86 transitions, 402 flow. Second operand 14 states and 958 transitions. [2021-11-07 08:23:37,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 894 flow [2021-11-07 08:23:37,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 773 flow, removed 59 selfloop flow, removed 8 redundant places. [2021-11-07 08:23:37,613 INFO L242 Difference]: Finished difference. Result has 125 places, 85 transitions, 430 flow [2021-11-07 08:23:37,614 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2021-11-07 08:23:37,614 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2021-11-07 08:23:37,614 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 430 flow [2021-11-07 08:23:37,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.3) internal successors, (663), 10 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:37,615 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:37,616 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:37,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:23:37,616 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 729552812, now seen corresponding path program 1 times [2021-11-07 08:23:37,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:37,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427965376] [2021-11-07 08:23:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:37,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:38,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:38,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427965376] [2021-11-07 08:23:38,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427965376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:38,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:38,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 08:23:38,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81054188] [2021-11-07 08:23:38,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 08:23:38,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 08:23:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-07 08:23:38,121 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 85 [2021-11-07 08:23:38,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 430 flow. Second operand has 15 states, 15 states have (on average 59.266666666666666) internal successors, (889), 15 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:38,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:38,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 85 [2021-11-07 08:23:38,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:39,295 INFO L129 PetriNetUnfolder]: 262/802 cut-off events. [2021-11-07 08:23:39,296 INFO L130 PetriNetUnfolder]: For 6570/6590 co-relation queries the response was YES. [2021-11-07 08:23:39,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 802 events. 262/802 cut-off events. For 6570/6590 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5254 event pairs, 21 based on Foata normal form. 17/815 useless extension candidates. Maximal degree in co-relation 3154. Up to 254 conditions per place. [2021-11-07 08:23:39,309 INFO L132 encePairwiseOnDemand]: 70/85 looper letters, 35 selfloop transitions, 11 changer transitions 54/151 dead transitions. [2021-11-07 08:23:39,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 151 transitions, 1292 flow [2021-11-07 08:23:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 08:23:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-11-07 08:23:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1604 transitions. [2021-11-07 08:23:39,315 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7257918552036199 [2021-11-07 08:23:39,316 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1604 transitions. [2021-11-07 08:23:39,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1604 transitions. [2021-11-07 08:23:39,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:39,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1604 transitions. [2021-11-07 08:23:39,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 61.69230769230769) internal successors, (1604), 26 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:39,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 85.0) internal successors, (2295), 27 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:39,342 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 85.0) internal successors, (2295), 27 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:39,342 INFO L186 Difference]: Start difference. First operand has 125 places, 85 transitions, 430 flow. Second operand 26 states and 1604 transitions. [2021-11-07 08:23:39,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 151 transitions, 1292 flow [2021-11-07 08:23:39,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 1033 flow, removed 121 selfloop flow, removed 13 redundant places. [2021-11-07 08:23:39,365 INFO L242 Difference]: Finished difference. Result has 150 places, 83 transitions, 453 flow [2021-11-07 08:23:39,366 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=453, PETRI_PLACES=150, PETRI_TRANSITIONS=83} [2021-11-07 08:23:39,366 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 62 predicate places. [2021-11-07 08:23:39,367 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 83 transitions, 453 flow [2021-11-07 08:23:39,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 59.266666666666666) internal successors, (889), 15 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:39,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:39,368 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:39,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:23:39,369 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash -673174030, now seen corresponding path program 2 times [2021-11-07 08:23:39,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:39,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155291304] [2021-11-07 08:23:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:39,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:39,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:39,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155291304] [2021-11-07 08:23:39,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155291304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:39,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:39,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 08:23:39,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722197940] [2021-11-07 08:23:39,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 08:23:39,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 08:23:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:23:39,873 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-11-07 08:23:39,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 83 transitions, 453 flow. Second operand has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:39,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:39,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-11-07 08:23:39,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:40,503 INFO L129 PetriNetUnfolder]: 77/325 cut-off events. [2021-11-07 08:23:40,504 INFO L130 PetriNetUnfolder]: For 5126/5269 co-relation queries the response was YES. [2021-11-07 08:23:40,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 325 events. 77/325 cut-off events. For 5126/5269 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1575 event pairs, 37 based on Foata normal form. 40/352 useless extension candidates. Maximal degree in co-relation 1722. Up to 120 conditions per place. [2021-11-07 08:23:40,512 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 17 selfloop transitions, 5 changer transitions 15/95 dead transitions. [2021-11-07 08:23:40,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 95 transitions, 779 flow [2021-11-07 08:23:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 08:23:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-07 08:23:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 917 transitions. [2021-11-07 08:23:40,516 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7705882352941177 [2021-11-07 08:23:40,516 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 917 transitions. [2021-11-07 08:23:40,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 917 transitions. [2021-11-07 08:23:40,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:40,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 917 transitions. [2021-11-07 08:23:40,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 65.5) internal successors, (917), 14 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:40,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:40,526 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:40,526 INFO L186 Difference]: Start difference. First operand has 150 places, 83 transitions, 453 flow. Second operand 14 states and 917 transitions. [2021-11-07 08:23:40,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 95 transitions, 779 flow [2021-11-07 08:23:40,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 95 transitions, 621 flow, removed 71 selfloop flow, removed 18 redundant places. [2021-11-07 08:23:40,547 INFO L242 Difference]: Finished difference. Result has 132 places, 79 transitions, 387 flow [2021-11-07 08:23:40,548 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=387, PETRI_PLACES=132, PETRI_TRANSITIONS=79} [2021-11-07 08:23:40,548 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 44 predicate places. [2021-11-07 08:23:40,549 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 79 transitions, 387 flow [2021-11-07 08:23:40,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.23076923076923) internal successors, (835), 13 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:40,550 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:40,550 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:40,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:23:40,551 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:40,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1228993504, now seen corresponding path program 3 times [2021-11-07 08:23:40,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:40,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444078779] [2021-11-07 08:23:40,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:40,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:40,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:40,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444078779] [2021-11-07 08:23:40,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444078779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:40,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:40,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:23:40,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816569992] [2021-11-07 08:23:40,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:23:40,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:23:40,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:23:40,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-11-07 08:23:40,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 79 transitions, 387 flow. Second operand has 11 states, 11 states have (on average 64.45454545454545) internal successors, (709), 11 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:40,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:40,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-11-07 08:23:40,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:41,352 INFO L129 PetriNetUnfolder]: 80/384 cut-off events. [2021-11-07 08:23:41,353 INFO L130 PetriNetUnfolder]: For 3504/3618 co-relation queries the response was YES. [2021-11-07 08:23:41,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 384 events. 80/384 cut-off events. For 3504/3618 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2155 event pairs, 16 based on Foata normal form. 29/403 useless extension candidates. Maximal degree in co-relation 1634. Up to 87 conditions per place. [2021-11-07 08:23:41,361 INFO L132 encePairwiseOnDemand]: 75/85 looper letters, 19 selfloop transitions, 8 changer transitions 10/95 dead transitions. [2021-11-07 08:23:41,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 95 transitions, 689 flow [2021-11-07 08:23:41,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 08:23:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-07 08:23:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 856 transitions. [2021-11-07 08:23:41,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7746606334841629 [2021-11-07 08:23:41,366 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 856 transitions. [2021-11-07 08:23:41,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 856 transitions. [2021-11-07 08:23:41,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:41,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 856 transitions. [2021-11-07 08:23:41,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.84615384615384) internal successors, (856), 13 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,375 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,375 INFO L186 Difference]: Start difference. First operand has 132 places, 79 transitions, 387 flow. Second operand 13 states and 856 transitions. [2021-11-07 08:23:41,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 95 transitions, 689 flow [2021-11-07 08:23:41,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 562 flow, removed 55 selfloop flow, removed 18 redundant places. [2021-11-07 08:23:41,395 INFO L242 Difference]: Finished difference. Result has 122 places, 79 transitions, 362 flow [2021-11-07 08:23:41,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=362, PETRI_PLACES=122, PETRI_TRANSITIONS=79} [2021-11-07 08:23:41,396 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2021-11-07 08:23:41,397 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 79 transitions, 362 flow [2021-11-07 08:23:41,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.45454545454545) internal successors, (709), 11 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,398 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:41,398 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:41,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:23:41,398 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash -813929410, now seen corresponding path program 1 times [2021-11-07 08:23:41,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:41,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089084977] [2021-11-07 08:23:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:41,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:41,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:41,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089084977] [2021-11-07 08:23:41,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089084977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:41,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:41,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:23:41,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9645698] [2021-11-07 08:23:41,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:23:41,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:23:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:23:41,538 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-07 08:23:41,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 79 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:41,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-07 08:23:41,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:41,767 INFO L129 PetriNetUnfolder]: 157/586 cut-off events. [2021-11-07 08:23:41,767 INFO L130 PetriNetUnfolder]: For 3929/3987 co-relation queries the response was YES. [2021-11-07 08:23:41,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 586 events. 157/586 cut-off events. For 3929/3987 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4129 event pairs, 10 based on Foata normal form. 35/575 useless extension candidates. Maximal degree in co-relation 1983. Up to 173 conditions per place. [2021-11-07 08:23:41,775 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 12 changer transitions 10/100 dead transitions. [2021-11-07 08:23:41,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 574 flow [2021-11-07 08:23:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:23:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-07 08:23:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-11-07 08:23:41,778 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-11-07 08:23:41,778 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-11-07 08:23:41,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-11-07 08:23:41,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:41,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-11-07 08:23:41,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,785 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,785 INFO L186 Difference]: Start difference. First operand has 122 places, 79 transitions, 362 flow. Second operand 10 states and 755 transitions. [2021-11-07 08:23:41,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 574 flow [2021-11-07 08:23:41,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 100 transitions, 516 flow, removed 22 selfloop flow, removed 16 redundant places. [2021-11-07 08:23:41,799 INFO L242 Difference]: Finished difference. Result has 113 places, 85 transitions, 369 flow [2021-11-07 08:23:41,800 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2021-11-07 08:23:41,800 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 25 predicate places. [2021-11-07 08:23:41,800 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 369 flow [2021-11-07 08:23:41,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,801 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:41,801 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:41,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:23:41,802 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash 907903445, now seen corresponding path program 1 times [2021-11-07 08:23:41,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:41,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499265712] [2021-11-07 08:23:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:41,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:23:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:23:41,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:23:41,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499265712] [2021-11-07 08:23:41,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499265712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:23:41,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:23:41,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 08:23:41,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067924518] [2021-11-07 08:23:41,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:23:41,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:23:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:23:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:23:41,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-07 08:23:41,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:41,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-07 08:23:41,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-07 08:23:41,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-07 08:23:42,203 INFO L129 PetriNetUnfolder]: 51/261 cut-off events. [2021-11-07 08:23:42,204 INFO L130 PetriNetUnfolder]: For 1251/1329 co-relation queries the response was YES. [2021-11-07 08:23:42,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 261 events. 51/261 cut-off events. For 1251/1329 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1374 event pairs, 0 based on Foata normal form. 39/291 useless extension candidates. Maximal degree in co-relation 811. Up to 68 conditions per place. [2021-11-07 08:23:42,207 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 11 selfloop transitions, 15 changer transitions 14/103 dead transitions. [2021-11-07 08:23:42,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 103 transitions, 553 flow [2021-11-07 08:23:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 08:23:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-07 08:23:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 970 transitions. [2021-11-07 08:23:42,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8778280542986425 [2021-11-07 08:23:42,211 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 970 transitions. [2021-11-07 08:23:42,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 970 transitions. [2021-11-07 08:23:42,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:23:42,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 970 transitions. [2021-11-07 08:23:42,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.61538461538461) internal successors, (970), 13 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:42,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:42,219 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:42,219 INFO L186 Difference]: Start difference. First operand has 113 places, 85 transitions, 369 flow. Second operand 13 states and 970 transitions. [2021-11-07 08:23:42,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 103 transitions, 553 flow [2021-11-07 08:23:42,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 103 transitions, 435 flow, removed 50 selfloop flow, removed 12 redundant places. [2021-11-07 08:23:42,229 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 354 flow [2021-11-07 08:23:42,230 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=354, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2021-11-07 08:23:42,231 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-11-07 08:23:42,231 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 354 flow [2021-11-07 08:23:42,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:23:42,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-07 08:23:42,232 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:42,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:23:42,233 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-07 08:23:42,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:23:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash 587720075, now seen corresponding path program 1 times [2021-11-07 08:23:42,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:23:42,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608144778] [2021-11-07 08:23:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:23:42,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:23:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:23:42,299 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:23:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:23:42,433 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:23:42,435 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 08:23:42,438 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:23:42,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:23:42,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-07 08:23:42,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-07 08:23:42,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:23:42,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:23:42,448 INFO L731 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:23:42,454 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-07 08:23:42,455 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:23:42,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:23:42 BasicIcfg [2021-11-07 08:23:42,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:23:42,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:23:42,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:23:42,659 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:23:42,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:23:28" (3/4) ... [2021-11-07 08:23:42,662 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 08:23:42,792 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:23:42,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:23:42,795 INFO L168 Benchmark]: Toolchain (without parser) took 18068.08 ms. Allocated memory was 88.1 MB in the beginning and 209.7 MB in the end (delta: 121.6 MB). Free memory was 54.3 MB in the beginning and 125.2 MB in the end (delta: -70.9 MB). Peak memory consumption was 49.5 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,795 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 88.1 MB. Free memory is still 40.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:23:42,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1010.21 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 54.2 MB in the beginning and 80.3 MB in the end (delta: -26.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.21 ms. Allocated memory is still 117.4 MB. Free memory was 80.3 MB in the beginning and 77.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,797 INFO L168 Benchmark]: Boogie Preprocessor took 97.05 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 75.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,798 INFO L168 Benchmark]: RCFGBuilder took 2579.24 ms. Allocated memory is still 117.4 MB. Free memory was 75.2 MB in the beginning and 73.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 47.2 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,798 INFO L168 Benchmark]: TraceAbstraction took 14102.92 ms. Allocated memory was 117.4 MB in the beginning and 209.7 MB in the end (delta: 92.3 MB). Free memory was 73.8 MB in the beginning and 144.1 MB in the end (delta: -70.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,799 INFO L168 Benchmark]: Witness Printer took 134.56 ms. Allocated memory is still 209.7 MB. Free memory was 144.1 MB in the beginning and 125.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-07 08:23:42,801 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.45 ms. Allocated memory is still 88.1 MB. Free memory is still 40.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1010.21 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 54.2 MB in the beginning and 80.3 MB in the end (delta: -26.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 135.21 ms. Allocated memory is still 117.4 MB. Free memory was 80.3 MB in the beginning and 77.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.05 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 75.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2579.24 ms. Allocated memory is still 117.4 MB. Free memory was 75.2 MB in the beginning and 73.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 47.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14102.92 ms. Allocated memory was 117.4 MB in the beginning and 209.7 MB in the end (delta: 92.3 MB). Free memory was 73.8 MB in the beginning and 144.1 MB in the end (delta: -70.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. * Witness Printer took 134.56 ms. Allocated memory is still 209.7 MB. Free memory was 144.1 MB in the beginning and 125.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 511 SDslu, 658 SDs, 0 SdLazy, 1308 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=11, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 5525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 08:23:42,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa2dee3c-b94d-4c25-8650-41bb37a80460/bin/uautomizer-AkOaLMaTGY/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