./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:31:57,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:31:57,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:31:57,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:31:57,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:31:57,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:31:57,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:31:57,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:31:57,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:31:57,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:31:57,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:31:57,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:31:57,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:31:57,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:31:57,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:31:57,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:31:57,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:31:57,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:31:57,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:31:57,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:31:57,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:31:57,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:31:57,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:31:57,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:31:57,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:31:57,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:31:57,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:31:57,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:31:57,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:31:57,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:31:57,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:31:57,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:31:57,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:31:57,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:31:57,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:31:57,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:31:57,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:31:57,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:31:57,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:31:57,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:31:57,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:31:57,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:31:57,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:31:57,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:31:57,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:31:57,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:31:57,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:31:57,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:31:57,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:31:57,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:31:57,708 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:31:57,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:31:57,709 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:31:57,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:31:57,710 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:31:57,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:31:57,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:31:57,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:31:57,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:31:57,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:31:57,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:31:57,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:31:57,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:31:57,712 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_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 [2021-12-07 00:31:57,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:31:57,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:31:57,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:31:57,908 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:31:57,909 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:31:57,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-07 00:31:57,963 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/data/6a59e290a/49d034793f634998b8e881662a44c533/FLAG794572980 [2021-12-07 00:31:58,389 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:31:58,390 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-07 00:31:58,401 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/data/6a59e290a/49d034793f634998b8e881662a44c533/FLAG794572980 [2021-12-07 00:31:58,411 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/data/6a59e290a/49d034793f634998b8e881662a44c533 [2021-12-07 00:31:58,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:31:58,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:31:58,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:31:58,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:31:58,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:31:58,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d54f24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58, skipping insertion in model container [2021-12-07 00:31:58,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:31:58,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:31:58,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-07 00:31:58,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:31:58,717 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:31:58,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-12-07 00:31:58,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:31:58,782 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:31:58,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58 WrapperNode [2021-12-07 00:31:58,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:31:58,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:31:58,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:31:58,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:31:58,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,823 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 282 [2021-12-07 00:31:58,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:31:58,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:31:58,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:31:58,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:31:58,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:31:58,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:31:58,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:31:58,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:31:58,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (1/1) ... [2021-12-07 00:31:58,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:31:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:31:58,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:31:58,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:31:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-07 00:31:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-07 00:31:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-07 00:31:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-07 00:31:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-07 00:31:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:31:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-07 00:31:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:31:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:31:58,909 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-07 00:31:58,992 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:31:58,993 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:31:59,277 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:31:59,555 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:31:59,555 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-07 00:31:59,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:31:59 BoogieIcfgContainer [2021-12-07 00:31:59,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:31:59,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:31:59,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:31:59,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:31:59,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:31:58" (1/3) ... [2021-12-07 00:31:59,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158c050d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:31:59, skipping insertion in model container [2021-12-07 00:31:59,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:58" (2/3) ... [2021-12-07 00:31:59,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158c050d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:31:59, skipping insertion in model container [2021-12-07 00:31:59,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:31:59" (3/3) ... [2021-12-07 00:31:59,563 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-07 00:31:59,567 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-07 00:31:59,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:31:59,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-07 00:31:59,567 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-07 00:31:59,593 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,594 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,595 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,596 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,597 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,598 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,599 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,616 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,617 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,617 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,617 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,619 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,619 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,619 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,620 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,620 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:31:59,620 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-07 00:31:59,654 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:31:59,660 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:31:59,660 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-07 00:31:59,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2021-12-07 00:31:59,705 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-12-07 00:31:59,705 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-07 00:31:59,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-12-07 00:31:59,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2021-12-07 00:31:59,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2021-12-07 00:31:59,725 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2021-12-07 00:31:59,725 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-07 00:31:59,725 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:31:59,725 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-12-07 00:31:59,726 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:31:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:31:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -746549581, now seen corresponding path program 1 times [2021-12-07 00:31:59,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:31:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397499604] [2021-12-07 00:31:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:31:59,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:31:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:00,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:00,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397499604] [2021-12-07 00:32:00,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397499604] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:00,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:00,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:32:00,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69028955] [2021-12-07 00:32:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:00,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:32:00,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:32:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:32:00,047 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2021-12-07 00:32:00,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:00,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2021-12-07 00:32:00,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:00,149 INFO L129 PetriNetUnfolder]: 17/194 cut-off events. [2021-12-07 00:32:00,149 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-07 00:32:00,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 194 events. 17/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 486 event pairs, 3 based on Foata normal form. 9/196 useless extension candidates. Maximal degree in co-relation 193. Up to 27 conditions per place. [2021-12-07 00:32:00,153 INFO L132 encePairwiseOnDemand]: 112/117 looper letters, 10 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2021-12-07 00:32:00,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 259 flow [2021-12-07 00:32:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:32:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-07 00:32:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2021-12-07 00:32:00,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2021-12-07 00:32:00,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2021-12-07 00:32:00,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2021-12-07 00:32:00,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:00,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2021-12-07 00:32:00,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,184 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 329 transitions. [2021-12-07 00:32:00,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 259 flow [2021-12-07 00:32:00,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 113 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-07 00:32:00,191 INFO L242 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2021-12-07 00:32:00,192 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2021-12-07 00:32:00,195 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2021-12-07 00:32:00,195 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2021-12-07 00:32:00,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,196 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:00,196 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:00,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:32:00,197 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash -849196144, now seen corresponding path program 1 times [2021-12-07 00:32:00,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:00,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474018720] [2021-12-07 00:32:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:00,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:00,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:00,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474018720] [2021-12-07 00:32:00,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474018720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:00,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:00,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:00,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248676924] [2021-12-07 00:32:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:00,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:00,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:00,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:00,384 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 117 [2021-12-07 00:32:00,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:00,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 117 [2021-12-07 00:32:00,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:00,725 INFO L129 PetriNetUnfolder]: 357/1207 cut-off events. [2021-12-07 00:32:00,725 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-12-07 00:32:00,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 1207 events. 357/1207 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8346 event pairs, 147 based on Foata normal form. 0/1165 useless extension candidates. Maximal degree in co-relation 1831. Up to 333 conditions per place. [2021-12-07 00:32:00,737 INFO L132 encePairwiseOnDemand]: 110/117 looper letters, 20 selfloop transitions, 3 changer transitions 48/153 dead transitions. [2021-12-07 00:32:00,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 153 transitions, 454 flow [2021-12-07 00:32:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2021-12-07 00:32:00,744 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.879392212725546 [2021-12-07 00:32:00,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2021-12-07 00:32:00,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2021-12-07 00:32:00,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:00,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2021-12-07 00:32:00,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.88888888888889) internal successors, (926), 9 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,755 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,755 INFO L186 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 9 states and 926 transitions. [2021-12-07 00:32:00,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 153 transitions, 454 flow [2021-12-07 00:32:00,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:32:00,761 INFO L242 Difference]: Finished difference. Result has 132 places, 100 transitions, 245 flow [2021-12-07 00:32:00,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=245, PETRI_PLACES=132, PETRI_TRANSITIONS=100} [2021-12-07 00:32:00,762 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2021-12-07 00:32:00,763 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 100 transitions, 245 flow [2021-12-07 00:32:00,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,763 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:00,764 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:00,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:32:00,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1737998769, now seen corresponding path program 1 times [2021-12-07 00:32:00,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:00,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288874409] [2021-12-07 00:32:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:00,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:00,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288874409] [2021-12-07 00:32:00,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288874409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:00,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:00,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:00,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781376923] [2021-12-07 00:32:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:00,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:00,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:00,925 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 117 [2021-12-07 00:32:00,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 100 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:00,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:00,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 117 [2021-12-07 00:32:00,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:01,159 INFO L129 PetriNetUnfolder]: 192/572 cut-off events. [2021-12-07 00:32:01,159 INFO L130 PetriNetUnfolder]: For 485/489 co-relation queries the response was YES. [2021-12-07 00:32:01,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 572 events. 192/572 cut-off events. For 485/489 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3061 event pairs, 49 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1180. Up to 116 conditions per place. [2021-12-07 00:32:01,164 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 15 selfloop transitions, 2 changer transitions 22/124 dead transitions. [2021-12-07 00:32:01,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 124 transitions, 389 flow [2021-12-07 00:32:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 914 transitions. [2021-12-07 00:32:01,167 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8679962013295347 [2021-12-07 00:32:01,167 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 914 transitions. [2021-12-07 00:32:01,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 914 transitions. [2021-12-07 00:32:01,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:01,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 914 transitions. [2021-12-07 00:32:01,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.55555555555556) internal successors, (914), 9 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,174 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,174 INFO L186 Difference]: Start difference. First operand has 132 places, 100 transitions, 245 flow. Second operand 9 states and 914 transitions. [2021-12-07 00:32:01,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 124 transitions, 389 flow [2021-12-07 00:32:01,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 372 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-07 00:32:01,181 INFO L242 Difference]: Finished difference. Result has 125 places, 100 transitions, 256 flow [2021-12-07 00:32:01,181 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=125, PETRI_TRANSITIONS=100} [2021-12-07 00:32:01,182 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 3 predicate places. [2021-12-07 00:32:01,182 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 100 transitions, 256 flow [2021-12-07 00:32:01,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,183 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:01,183 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:01,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:32:01,184 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -301428498, now seen corresponding path program 1 times [2021-12-07 00:32:01,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:01,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244048707] [2021-12-07 00:32:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:01,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:01,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:01,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244048707] [2021-12-07 00:32:01,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244048707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:01,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:01,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:32:01,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119548574] [2021-12-07 00:32:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:01,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:32:01,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:32:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:32:01,443 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2021-12-07 00:32:01,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 100 transitions, 256 flow. Second operand has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:01,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2021-12-07 00:32:01,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:01,725 INFO L129 PetriNetUnfolder]: 173/507 cut-off events. [2021-12-07 00:32:01,725 INFO L130 PetriNetUnfolder]: For 628/631 co-relation queries the response was YES. [2021-12-07 00:32:01,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 507 events. 173/507 cut-off events. For 628/631 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2517 event pairs, 57 based on Foata normal form. 14/495 useless extension candidates. Maximal degree in co-relation 1154. Up to 169 conditions per place. [2021-12-07 00:32:01,732 INFO L132 encePairwiseOnDemand]: 105/117 looper letters, 17 selfloop transitions, 9 changer transitions 22/129 dead transitions. [2021-12-07 00:32:01,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 440 flow [2021-12-07 00:32:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 00:32:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-07 00:32:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1352 transitions. [2021-12-07 00:32:01,738 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2021-12-07 00:32:01,738 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1352 transitions. [2021-12-07 00:32:01,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1352 transitions. [2021-12-07 00:32:01,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:01,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1352 transitions. [2021-12-07 00:32:01,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.57142857142857) internal successors, (1352), 14 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,750 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,750 INFO L186 Difference]: Start difference. First operand has 125 places, 100 transitions, 256 flow. Second operand 14 states and 1352 transitions. [2021-12-07 00:32:01,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 440 flow [2021-12-07 00:32:01,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 129 transitions, 408 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-07 00:32:01,757 INFO L242 Difference]: Finished difference. Result has 132 places, 104 transitions, 298 flow [2021-12-07 00:32:01,757 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=298, PETRI_PLACES=132, PETRI_TRANSITIONS=104} [2021-12-07 00:32:01,758 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2021-12-07 00:32:01,758 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 104 transitions, 298 flow [2021-12-07 00:32:01,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:01,759 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:01,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:32:01,759 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1762884665, now seen corresponding path program 1 times [2021-12-07 00:32:01,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:01,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898037696] [2021-12-07 00:32:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:01,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:01,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:01,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898037696] [2021-12-07 00:32:01,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898037696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:01,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:01,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:32:01,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080938780] [2021-12-07 00:32:01,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:01,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:32:01,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:32:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:32:01,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2021-12-07 00:32:01,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 104 transitions, 298 flow. Second operand has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:01,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:01,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2021-12-07 00:32:01,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:02,243 INFO L129 PetriNetUnfolder]: 152/474 cut-off events. [2021-12-07 00:32:02,243 INFO L130 PetriNetUnfolder]: For 895/898 co-relation queries the response was YES. [2021-12-07 00:32:02,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 474 events. 152/474 cut-off events. For 895/898 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2284 event pairs, 30 based on Foata normal form. 8/458 useless extension candidates. Maximal degree in co-relation 1269. Up to 159 conditions per place. [2021-12-07 00:32:02,247 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 20 selfloop transitions, 11 changer transitions 10/123 dead transitions. [2021-12-07 00:32:02,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 123 transitions, 472 flow [2021-12-07 00:32:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions. [2021-12-07 00:32:02,250 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8404558404558404 [2021-12-07 00:32:02,250 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 885 transitions. [2021-12-07 00:32:02,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions. [2021-12-07 00:32:02,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:02,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions. [2021-12-07 00:32:02,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,255 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,255 INFO L186 Difference]: Start difference. First operand has 132 places, 104 transitions, 298 flow. Second operand 9 states and 885 transitions. [2021-12-07 00:32:02,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 123 transitions, 472 flow [2021-12-07 00:32:02,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 123 transitions, 454 flow, removed 5 selfloop flow, removed 7 redundant places. [2021-12-07 00:32:02,259 INFO L242 Difference]: Finished difference. Result has 132 places, 110 transitions, 354 flow [2021-12-07 00:32:02,260 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=132, PETRI_TRANSITIONS=110} [2021-12-07 00:32:02,260 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2021-12-07 00:32:02,261 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 110 transitions, 354 flow [2021-12-07 00:32:02,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,261 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:02,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:02,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:32:02,262 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash 884968875, now seen corresponding path program 2 times [2021-12-07 00:32:02,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:02,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746926823] [2021-12-07 00:32:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:02,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:02,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746926823] [2021-12-07 00:32:02,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746926823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:02,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:02,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:32:02,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709921344] [2021-12-07 00:32:02,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:02,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:32:02,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:02,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:32:02,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:32:02,452 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2021-12-07 00:32:02,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 110 transitions, 354 flow. Second operand has 10 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:02,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2021-12-07 00:32:02,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:02,735 INFO L129 PetriNetUnfolder]: 154/469 cut-off events. [2021-12-07 00:32:02,735 INFO L130 PetriNetUnfolder]: For 1282/1403 co-relation queries the response was YES. [2021-12-07 00:32:02,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 469 events. 154/469 cut-off events. For 1282/1403 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2205 event pairs, 23 based on Foata normal form. 16/463 useless extension candidates. Maximal degree in co-relation 1514. Up to 162 conditions per place. [2021-12-07 00:32:02,740 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 22 selfloop transitions, 12 changer transitions 19/134 dead transitions. [2021-12-07 00:32:02,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 648 flow [2021-12-07 00:32:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:32:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-07 00:32:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1166 transitions. [2021-12-07 00:32:02,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8304843304843305 [2021-12-07 00:32:02,743 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1166 transitions. [2021-12-07 00:32:02,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1166 transitions. [2021-12-07 00:32:02,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:02,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1166 transitions. [2021-12-07 00:32:02,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 97.16666666666667) internal successors, (1166), 12 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,750 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,750 INFO L186 Difference]: Start difference. First operand has 132 places, 110 transitions, 354 flow. Second operand 12 states and 1166 transitions. [2021-12-07 00:32:02,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 648 flow [2021-12-07 00:32:02,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 616 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-12-07 00:32:02,755 INFO L242 Difference]: Finished difference. Result has 142 places, 112 transitions, 407 flow [2021-12-07 00:32:02,755 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=407, PETRI_PLACES=142, PETRI_TRANSITIONS=112} [2021-12-07 00:32:02,756 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 20 predicate places. [2021-12-07 00:32:02,756 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 112 transitions, 407 flow [2021-12-07 00:32:02,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,756 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:02,757 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:02,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:32:02,757 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1175113785, now seen corresponding path program 3 times [2021-12-07 00:32:02,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:02,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549646650] [2021-12-07 00:32:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:02,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:02,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:02,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549646650] [2021-12-07 00:32:02,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549646650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:02,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:02,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:32:02,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972784236] [2021-12-07 00:32:02,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:02,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:32:02,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:02,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:32:02,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:32:02,932 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2021-12-07 00:32:02,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 112 transitions, 407 flow. Second operand has 11 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:02,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:02,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2021-12-07 00:32:02,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:03,290 INFO L129 PetriNetUnfolder]: 156/489 cut-off events. [2021-12-07 00:32:03,290 INFO L130 PetriNetUnfolder]: For 3167/3232 co-relation queries the response was YES. [2021-12-07 00:32:03,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 489 events. 156/489 cut-off events. For 3167/3232 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2265 event pairs, 19 based on Foata normal form. 28/496 useless extension candidates. Maximal degree in co-relation 2002. Up to 163 conditions per place. [2021-12-07 00:32:03,299 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 21 selfloop transitions, 16 changer transitions 19/137 dead transitions. [2021-12-07 00:32:03,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 137 transitions, 844 flow [2021-12-07 00:32:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:32:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:32:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1258 transitions. [2021-12-07 00:32:03,303 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8270874424720579 [2021-12-07 00:32:03,303 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1258 transitions. [2021-12-07 00:32:03,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1258 transitions. [2021-12-07 00:32:03,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:03,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1258 transitions. [2021-12-07 00:32:03,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.76923076923077) internal successors, (1258), 13 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,309 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,309 INFO L186 Difference]: Start difference. First operand has 142 places, 112 transitions, 407 flow. Second operand 13 states and 1258 transitions. [2021-12-07 00:32:03,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 137 transitions, 844 flow [2021-12-07 00:32:03,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 137 transitions, 799 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-12-07 00:32:03,315 INFO L242 Difference]: Finished difference. Result has 148 places, 116 transitions, 489 flow [2021-12-07 00:32:03,316 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=489, PETRI_PLACES=148, PETRI_TRANSITIONS=116} [2021-12-07 00:32:03,316 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 26 predicate places. [2021-12-07 00:32:03,316 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 116 transitions, 489 flow [2021-12-07 00:32:03,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,317 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:03,317 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:03,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:32:03,317 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -531120057, now seen corresponding path program 4 times [2021-12-07 00:32:03,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:03,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686807820] [2021-12-07 00:32:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:03,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:03,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:03,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686807820] [2021-12-07 00:32:03,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686807820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:03,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:03,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:32:03,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124425017] [2021-12-07 00:32:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:03,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:32:03,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:32:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:32:03,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2021-12-07 00:32:03,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 116 transitions, 489 flow. Second operand has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:03,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2021-12-07 00:32:03,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:03,704 INFO L129 PetriNetUnfolder]: 170/519 cut-off events. [2021-12-07 00:32:03,704 INFO L130 PetriNetUnfolder]: For 5751/5824 co-relation queries the response was YES. [2021-12-07 00:32:03,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 519 events. 170/519 cut-off events. For 5751/5824 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2473 event pairs, 19 based on Foata normal form. 34/530 useless extension candidates. Maximal degree in co-relation 2542. Up to 168 conditions per place. [2021-12-07 00:32:03,713 INFO L132 encePairwiseOnDemand]: 105/117 looper letters, 25 selfloop transitions, 18 changer transitions 10/135 dead transitions. [2021-12-07 00:32:03,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 135 transitions, 865 flow [2021-12-07 00:32:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:32:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-07 00:32:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1077 transitions. [2021-12-07 00:32:03,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8368298368298368 [2021-12-07 00:32:03,718 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1077 transitions. [2021-12-07 00:32:03,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1077 transitions. [2021-12-07 00:32:03,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:03,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1077 transitions. [2021-12-07 00:32:03,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.9090909090909) internal successors, (1077), 11 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,725 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,726 INFO L186 Difference]: Start difference. First operand has 148 places, 116 transitions, 489 flow. Second operand 11 states and 1077 transitions. [2021-12-07 00:32:03,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 135 transitions, 865 flow [2021-12-07 00:32:03,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 135 transitions, 720 flow, removed 71 selfloop flow, removed 11 redundant places. [2021-12-07 00:32:03,736 INFO L242 Difference]: Finished difference. Result has 145 places, 119 transitions, 519 flow [2021-12-07 00:32:03,737 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=519, PETRI_PLACES=145, PETRI_TRANSITIONS=119} [2021-12-07 00:32:03,738 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 23 predicate places. [2021-12-07 00:32:03,738 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 119 transitions, 519 flow [2021-12-07 00:32:03,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:03,739 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:03,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:32:03,739 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1279809689, now seen corresponding path program 5 times [2021-12-07 00:32:03,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:03,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483626812] [2021-12-07 00:32:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:03,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:03,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:03,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483626812] [2021-12-07 00:32:03,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483626812] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:03,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:03,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:32:03,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355182332] [2021-12-07 00:32:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:03,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:32:03,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:03,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:32:03,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:32:03,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2021-12-07 00:32:03,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 119 transitions, 519 flow. Second operand has 11 states, 11 states have (on average 93.63636363636364) internal successors, (1030), 11 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:03,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:03,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2021-12-07 00:32:03,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:04,226 INFO L129 PetriNetUnfolder]: 155/486 cut-off events. [2021-12-07 00:32:04,226 INFO L130 PetriNetUnfolder]: For 3352/3631 co-relation queries the response was YES. [2021-12-07 00:32:04,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 486 events. 155/486 cut-off events. For 3352/3631 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2375 event pairs, 23 based on Foata normal form. 21/484 useless extension candidates. Maximal degree in co-relation 2197. Up to 143 conditions per place. [2021-12-07 00:32:04,235 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 33 selfloop transitions, 13 changer transitions 19/145 dead transitions. [2021-12-07 00:32:04,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 145 transitions, 987 flow [2021-12-07 00:32:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:32:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:32:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1247 transitions. [2021-12-07 00:32:04,239 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8198553583168968 [2021-12-07 00:32:04,239 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1247 transitions. [2021-12-07 00:32:04,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1247 transitions. [2021-12-07 00:32:04,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:04,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1247 transitions. [2021-12-07 00:32:04,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.92307692307692) internal successors, (1247), 13 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,248 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,248 INFO L186 Difference]: Start difference. First operand has 145 places, 119 transitions, 519 flow. Second operand 13 states and 1247 transitions. [2021-12-07 00:32:04,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 145 transitions, 987 flow [2021-12-07 00:32:04,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 945 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-12-07 00:32:04,259 INFO L242 Difference]: Finished difference. Result has 153 places, 121 transitions, 589 flow [2021-12-07 00:32:04,259 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=589, PETRI_PLACES=153, PETRI_TRANSITIONS=121} [2021-12-07 00:32:04,260 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 31 predicate places. [2021-12-07 00:32:04,260 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 121 transitions, 589 flow [2021-12-07 00:32:04,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.63636363636364) internal successors, (1030), 11 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,261 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:04,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:04,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:32:04,262 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1200699757, now seen corresponding path program 1 times [2021-12-07 00:32:04,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:04,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221377668] [2021-12-07 00:32:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:04,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:04,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:04,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221377668] [2021-12-07 00:32:04,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221377668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:04,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:04,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 00:32:04,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634733315] [2021-12-07 00:32:04,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:04,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 00:32:04,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:04,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 00:32:04,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:32:04,444 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2021-12-07 00:32:04,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 121 transitions, 589 flow. Second operand has 11 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:04,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2021-12-07 00:32:04,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:04,712 INFO L129 PetriNetUnfolder]: 122/512 cut-off events. [2021-12-07 00:32:04,712 INFO L130 PetriNetUnfolder]: For 4287/4654 co-relation queries the response was YES. [2021-12-07 00:32:04,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 512 events. 122/512 cut-off events. For 4287/4654 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2728 event pairs, 10 based on Foata normal form. 22/511 useless extension candidates. Maximal degree in co-relation 2256. Up to 135 conditions per place. [2021-12-07 00:32:04,728 INFO L132 encePairwiseOnDemand]: 106/117 looper letters, 34 selfloop transitions, 17 changer transitions 10/142 dead transitions. [2021-12-07 00:32:04,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 142 transitions, 983 flow [2021-12-07 00:32:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:32:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:32:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2021-12-07 00:32:04,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8238001314924391 [2021-12-07 00:32:04,731 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2021-12-07 00:32:04,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2021-12-07 00:32:04,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:04,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2021-12-07 00:32:04,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,739 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,739 INFO L186 Difference]: Start difference. First operand has 153 places, 121 transitions, 589 flow. Second operand 13 states and 1253 transitions. [2021-12-07 00:32:04,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 142 transitions, 983 flow [2021-12-07 00:32:04,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 142 transitions, 870 flow, removed 51 selfloop flow, removed 10 redundant places. [2021-12-07 00:32:04,747 INFO L242 Difference]: Finished difference. Result has 157 places, 126 transitions, 682 flow [2021-12-07 00:32:04,747 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=682, PETRI_PLACES=157, PETRI_TRANSITIONS=126} [2021-12-07 00:32:04,748 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 35 predicate places. [2021-12-07 00:32:04,748 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 126 transitions, 682 flow [2021-12-07 00:32:04,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,749 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:04,749 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:04,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 00:32:04,749 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -4204419, now seen corresponding path program 2 times [2021-12-07 00:32:04,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:04,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54563522] [2021-12-07 00:32:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:04,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:04,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:04,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54563522] [2021-12-07 00:32:04,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54563522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:04,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:04,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-07 00:32:04,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899420042] [2021-12-07 00:32:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:04,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-07 00:32:04,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:04,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-07 00:32:04,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-07 00:32:04,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2021-12-07 00:32:04,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 126 transitions, 682 flow. Second operand has 13 states, 13 states have (on average 93.46153846153847) internal successors, (1215), 13 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:04,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:04,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2021-12-07 00:32:04,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:05,304 INFO L129 PetriNetUnfolder]: 126/519 cut-off events. [2021-12-07 00:32:05,304 INFO L130 PetriNetUnfolder]: For 4248/4671 co-relation queries the response was YES. [2021-12-07 00:32:05,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2411 conditions, 519 events. 126/519 cut-off events. For 4248/4671 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2796 event pairs, 15 based on Foata normal form. 57/554 useless extension candidates. Maximal degree in co-relation 2321. Up to 162 conditions per place. [2021-12-07 00:32:05,310 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 33 selfloop transitions, 23 changer transitions 10/146 dead transitions. [2021-12-07 00:32:05,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 146 transitions, 1058 flow [2021-12-07 00:32:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 00:32:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-07 00:32:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2021-12-07 00:32:05,313 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8136752136752137 [2021-12-07 00:32:05,313 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2021-12-07 00:32:05,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2021-12-07 00:32:05,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:05,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2021-12-07 00:32:05,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,321 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,321 INFO L186 Difference]: Start difference. First operand has 157 places, 126 transitions, 682 flow. Second operand 15 states and 1428 transitions. [2021-12-07 00:32:05,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 146 transitions, 1058 flow [2021-12-07 00:32:05,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 146 transitions, 979 flow, removed 37 selfloop flow, removed 9 redundant places. [2021-12-07 00:32:05,335 INFO L242 Difference]: Finished difference. Result has 163 places, 128 transitions, 758 flow [2021-12-07 00:32:05,335 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=758, PETRI_PLACES=163, PETRI_TRANSITIONS=128} [2021-12-07 00:32:05,336 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 41 predicate places. [2021-12-07 00:32:05,336 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 128 transitions, 758 flow [2021-12-07 00:32:05,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.46153846153847) internal successors, (1215), 13 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,337 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:05,337 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:05,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 00:32:05,337 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2102677655, now seen corresponding path program 3 times [2021-12-07 00:32:05,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:05,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079992360] [2021-12-07 00:32:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:05,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:05,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:05,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079992360] [2021-12-07 00:32:05,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079992360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:05,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:05,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-07 00:32:05,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882160503] [2021-12-07 00:32:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:05,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 00:32:05,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 00:32:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-07 00:32:05,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 117 [2021-12-07 00:32:05,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 128 transitions, 758 flow. Second operand has 14 states, 14 states have (on average 91.5) internal successors, (1281), 14 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:05,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 117 [2021-12-07 00:32:05,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:05,957 INFO L129 PetriNetUnfolder]: 128/531 cut-off events. [2021-12-07 00:32:05,957 INFO L130 PetriNetUnfolder]: For 5284/5667 co-relation queries the response was YES. [2021-12-07 00:32:05,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 531 events. 128/531 cut-off events. For 5284/5667 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2891 event pairs, 23 based on Foata normal form. 47/555 useless extension candidates. Maximal degree in co-relation 2506. Up to 188 conditions per place. [2021-12-07 00:32:05,964 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 37 selfloop transitions, 18 changer transitions 10/143 dead transitions. [2021-12-07 00:32:05,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 143 transitions, 1111 flow [2021-12-07 00:32:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 00:32:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-07 00:32:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1393 transitions. [2021-12-07 00:32:05,966 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7937321937321937 [2021-12-07 00:32:05,966 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1393 transitions. [2021-12-07 00:32:05,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1393 transitions. [2021-12-07 00:32:05,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:05,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1393 transitions. [2021-12-07 00:32:05,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 92.86666666666666) internal successors, (1393), 15 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,971 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,971 INFO L186 Difference]: Start difference. First operand has 163 places, 128 transitions, 758 flow. Second operand 15 states and 1393 transitions. [2021-12-07 00:32:05,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 143 transitions, 1111 flow [2021-12-07 00:32:05,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 143 transitions, 999 flow, removed 46 selfloop flow, removed 12 redundant places. [2021-12-07 00:32:05,982 INFO L242 Difference]: Finished difference. Result has 166 places, 129 transitions, 783 flow [2021-12-07 00:32:05,982 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=783, PETRI_PLACES=166, PETRI_TRANSITIONS=129} [2021-12-07 00:32:05,983 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 44 predicate places. [2021-12-07 00:32:05,983 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 129 transitions, 783 flow [2021-12-07 00:32:05,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 91.5) internal successors, (1281), 14 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:05,984 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:05,985 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:05,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 00:32:05,985 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:05,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1066597203, now seen corresponding path program 4 times [2021-12-07 00:32:05,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:05,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113087627] [2021-12-07 00:32:05,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:05,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:06,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:06,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113087627] [2021-12-07 00:32:06,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113087627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:06,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:06,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-07 00:32:06,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6676672] [2021-12-07 00:32:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:06,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 00:32:06,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 00:32:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-07 00:32:06,176 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2021-12-07 00:32:06,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 129 transitions, 783 flow. Second operand has 12 states, 12 states have (on average 92.66666666666667) internal successors, (1112), 12 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:06,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:06,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2021-12-07 00:32:06,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:06,436 INFO L129 PetriNetUnfolder]: 111/504 cut-off events. [2021-12-07 00:32:06,436 INFO L130 PetriNetUnfolder]: For 3986/4656 co-relation queries the response was YES. [2021-12-07 00:32:06,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 504 events. 111/504 cut-off events. For 3986/4656 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2709 event pairs, 11 based on Foata normal form. 30/509 useless extension candidates. Maximal degree in co-relation 2275. Up to 116 conditions per place. [2021-12-07 00:32:06,442 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 41 selfloop transitions, 14 changer transitions 11/145 dead transitions. [2021-12-07 00:32:06,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1126 flow [2021-12-07 00:32:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:32:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:32:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1226 transitions. [2021-12-07 00:32:06,444 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8060486522024983 [2021-12-07 00:32:06,444 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1226 transitions. [2021-12-07 00:32:06,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1226 transitions. [2021-12-07 00:32:06,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:06,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1226 transitions. [2021-12-07 00:32:06,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.3076923076923) internal successors, (1226), 13 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:06,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:06,447 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:06,448 INFO L186 Difference]: Start difference. First operand has 166 places, 129 transitions, 783 flow. Second operand 13 states and 1226 transitions. [2021-12-07 00:32:06,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1126 flow [2021-12-07 00:32:06,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 145 transitions, 1011 flow, removed 43 selfloop flow, removed 13 redundant places. [2021-12-07 00:32:06,457 INFO L242 Difference]: Finished difference. Result has 166 places, 128 transitions, 751 flow [2021-12-07 00:32:06,458 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=751, PETRI_PLACES=166, PETRI_TRANSITIONS=128} [2021-12-07 00:32:06,458 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 44 predicate places. [2021-12-07 00:32:06,458 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 128 transitions, 751 flow [2021-12-07 00:32:06,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.66666666666667) internal successors, (1112), 12 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:06,459 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:06,459 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:06,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 00:32:06,459 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1891431093, now seen corresponding path program 1 times [2021-12-07 00:32:06,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:06,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692911899] [2021-12-07 00:32:06,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:06,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:06,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:06,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692911899] [2021-12-07 00:32:06,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692911899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:06,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:06,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:06,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929964358] [2021-12-07 00:32:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:06,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:06,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:06,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:06,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2021-12-07 00:32:06,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 128 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:06,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:06,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2021-12-07 00:32:06,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:06,967 INFO L129 PetriNetUnfolder]: 1202/2643 cut-off events. [2021-12-07 00:32:06,967 INFO L130 PetriNetUnfolder]: For 21246/21710 co-relation queries the response was YES. [2021-12-07 00:32:06,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10710 conditions, 2643 events. 1202/2643 cut-off events. For 21246/21710 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19337 event pairs, 97 based on Foata normal form. 266/2807 useless extension candidates. Maximal degree in co-relation 10621. Up to 806 conditions per place. [2021-12-07 00:32:07,003 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 127 selfloop transitions, 15 changer transitions 26/251 dead transitions. [2021-12-07 00:32:07,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 251 transitions, 2576 flow [2021-12-07 00:32:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:32:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:32:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1014 transitions. [2021-12-07 00:32:07,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2021-12-07 00:32:07,005 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1014 transitions. [2021-12-07 00:32:07,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1014 transitions. [2021-12-07 00:32:07,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:07,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1014 transitions. [2021-12-07 00:32:07,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.4) internal successors, (1014), 10 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,008 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,008 INFO L186 Difference]: Start difference. First operand has 166 places, 128 transitions, 751 flow. Second operand 10 states and 1014 transitions. [2021-12-07 00:32:07,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 251 transitions, 2576 flow [2021-12-07 00:32:07,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 251 transitions, 2476 flow, removed 11 selfloop flow, removed 11 redundant places. [2021-12-07 00:32:07,027 INFO L242 Difference]: Finished difference. Result has 164 places, 141 transitions, 816 flow [2021-12-07 00:32:07,027 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=816, PETRI_PLACES=164, PETRI_TRANSITIONS=141} [2021-12-07 00:32:07,027 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 42 predicate places. [2021-12-07 00:32:07,027 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 141 transitions, 816 flow [2021-12-07 00:32:07,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,028 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:07,028 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:07,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 00:32:07,028 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash -836567024, now seen corresponding path program 1 times [2021-12-07 00:32:07,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:07,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906144713] [2021-12-07 00:32:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:07,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:07,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:07,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906144713] [2021-12-07 00:32:07,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906144713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:07,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:07,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:32:07,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993434847] [2021-12-07 00:32:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:07,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:32:07,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:32:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:32:07,106 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2021-12-07 00:32:07,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 141 transitions, 816 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:07,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2021-12-07 00:32:07,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:07,657 INFO L129 PetriNetUnfolder]: 1005/2407 cut-off events. [2021-12-07 00:32:07,657 INFO L130 PetriNetUnfolder]: For 19107/19531 co-relation queries the response was YES. [2021-12-07 00:32:07,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11065 conditions, 2407 events. 1005/2407 cut-off events. For 19107/19531 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18645 event pairs, 42 based on Foata normal form. 305/2671 useless extension candidates. Maximal degree in co-relation 10977. Up to 510 conditions per place. [2021-12-07 00:32:07,679 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 107 selfloop transitions, 28 changer transitions 46/264 dead transitions. [2021-12-07 00:32:07,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 264 transitions, 2757 flow [2021-12-07 00:32:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:32:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:32:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1318 transitions. [2021-12-07 00:32:07,682 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8665351742274819 [2021-12-07 00:32:07,682 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1318 transitions. [2021-12-07 00:32:07,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1318 transitions. [2021-12-07 00:32:07,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:07,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1318 transitions. [2021-12-07 00:32:07,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.38461538461539) internal successors, (1318), 13 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,686 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,686 INFO L186 Difference]: Start difference. First operand has 164 places, 141 transitions, 816 flow. Second operand 13 states and 1318 transitions. [2021-12-07 00:32:07,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 264 transitions, 2757 flow [2021-12-07 00:32:07,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 264 transitions, 2420 flow, removed 85 selfloop flow, removed 10 redundant places. [2021-12-07 00:32:07,708 INFO L242 Difference]: Finished difference. Result has 172 places, 146 transitions, 842 flow [2021-12-07 00:32:07,709 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=842, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2021-12-07 00:32:07,709 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 50 predicate places. [2021-12-07 00:32:07,709 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 842 flow [2021-12-07 00:32:07,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,709 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:07,710 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:07,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 00:32:07,710 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1817214867, now seen corresponding path program 1 times [2021-12-07 00:32:07,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:07,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77735942] [2021-12-07 00:32:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:07,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:07,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:07,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77735942] [2021-12-07 00:32:07,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77735942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:07,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:07,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:32:07,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245173927] [2021-12-07 00:32:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:07,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:32:07,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:07,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:32:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:32:07,809 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2021-12-07 00:32:07,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 146 transitions, 842 flow. Second operand has 9 states, 9 states have (on average 95.0) internal successors, (855), 9 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:07,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:07,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2021-12-07 00:32:07,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:08,225 INFO L129 PetriNetUnfolder]: 436/2159 cut-off events. [2021-12-07 00:32:08,225 INFO L130 PetriNetUnfolder]: For 7405/8241 co-relation queries the response was YES. [2021-12-07 00:32:08,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7538 conditions, 2159 events. 436/2159 cut-off events. For 7405/8241 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 22628 event pairs, 28 based on Foata normal form. 38/2066 useless extension candidates. Maximal degree in co-relation 7445. Up to 444 conditions per place. [2021-12-07 00:32:08,242 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 47 selfloop transitions, 2 changer transitions 40/202 dead transitions. [2021-12-07 00:32:08,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 202 transitions, 1622 flow [2021-12-07 00:32:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions. [2021-12-07 00:32:08,244 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8404558404558404 [2021-12-07 00:32:08,244 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 885 transitions. [2021-12-07 00:32:08,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions. [2021-12-07 00:32:08,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:08,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions. [2021-12-07 00:32:08,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,246 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,246 INFO L186 Difference]: Start difference. First operand has 172 places, 146 transitions, 842 flow. Second operand 9 states and 885 transitions. [2021-12-07 00:32:08,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 202 transitions, 1622 flow [2021-12-07 00:32:08,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 202 transitions, 1506 flow, removed 37 selfloop flow, removed 6 redundant places. [2021-12-07 00:32:08,289 INFO L242 Difference]: Finished difference. Result has 181 places, 145 transitions, 793 flow [2021-12-07 00:32:08,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=181, PETRI_TRANSITIONS=145} [2021-12-07 00:32:08,290 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 59 predicate places. [2021-12-07 00:32:08,290 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 145 transitions, 793 flow [2021-12-07 00:32:08,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.0) internal successors, (855), 9 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,290 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:08,290 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:08,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 00:32:08,291 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash -643063533, now seen corresponding path program 2 times [2021-12-07 00:32:08,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:08,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448950490] [2021-12-07 00:32:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:08,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:08,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:08,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448950490] [2021-12-07 00:32:08,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448950490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:08,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:08,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:08,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074919567] [2021-12-07 00:32:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:08,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:08,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:08,357 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 117 [2021-12-07 00:32:08,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 145 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:08,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 117 [2021-12-07 00:32:08,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:08,862 INFO L129 PetriNetUnfolder]: 603/3081 cut-off events. [2021-12-07 00:32:08,862 INFO L130 PetriNetUnfolder]: For 8270/8658 co-relation queries the response was YES. [2021-12-07 00:32:08,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9393 conditions, 3081 events. 603/3081 cut-off events. For 8270/8658 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35369 event pairs, 13 based on Foata normal form. 58/3006 useless extension candidates. Maximal degree in co-relation 9298. Up to 408 conditions per place. [2021-12-07 00:32:08,908 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 41 selfloop transitions, 3 changer transitions 24/183 dead transitions. [2021-12-07 00:32:08,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 183 transitions, 1348 flow [2021-12-07 00:32:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions. [2021-12-07 00:32:08,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.862298195631529 [2021-12-07 00:32:08,909 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 908 transitions. [2021-12-07 00:32:08,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions. [2021-12-07 00:32:08,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:08,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions. [2021-12-07 00:32:08,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,912 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,912 INFO L186 Difference]: Start difference. First operand has 181 places, 145 transitions, 793 flow. Second operand 9 states and 908 transitions. [2021-12-07 00:32:08,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 183 transitions, 1348 flow [2021-12-07 00:32:08,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 183 transitions, 1275 flow, removed 32 selfloop flow, removed 5 redundant places. [2021-12-07 00:32:08,950 INFO L242 Difference]: Finished difference. Result has 186 places, 145 transitions, 790 flow [2021-12-07 00:32:08,951 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=790, PETRI_PLACES=186, PETRI_TRANSITIONS=145} [2021-12-07 00:32:08,951 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 64 predicate places. [2021-12-07 00:32:08,951 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 145 transitions, 790 flow [2021-12-07 00:32:08,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:08,951 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:08,951 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:08,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 00:32:08,952 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:08,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1188351442, now seen corresponding path program 1 times [2021-12-07 00:32:08,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:08,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189087802] [2021-12-07 00:32:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:08,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:09,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:09,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189087802] [2021-12-07 00:32:09,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189087802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:09,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:09,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:32:09,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770384880] [2021-12-07 00:32:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:09,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:32:09,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:32:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:32:09,028 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2021-12-07 00:32:09,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 145 transitions, 790 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:09,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:09,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2021-12-07 00:32:09,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:09,937 INFO L129 PetriNetUnfolder]: 1879/5025 cut-off events. [2021-12-07 00:32:09,937 INFO L130 PetriNetUnfolder]: For 26933/27827 co-relation queries the response was YES. [2021-12-07 00:32:09,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21576 conditions, 5025 events. 1879/5025 cut-off events. For 26933/27827 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 51400 event pairs, 31 based on Foata normal form. 461/5379 useless extension candidates. Maximal degree in co-relation 21529. Up to 918 conditions per place. [2021-12-07 00:32:09,964 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 20 selfloop transitions, 12 changer transitions 136/247 dead transitions. [2021-12-07 00:32:09,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 247 transitions, 2173 flow [2021-12-07 00:32:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:32:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-07 00:32:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1588 transitions. [2021-12-07 00:32:09,966 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482905982905983 [2021-12-07 00:32:09,966 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1588 transitions. [2021-12-07 00:32:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1588 transitions. [2021-12-07 00:32:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:09,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1588 transitions. [2021-12-07 00:32:09,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.25) internal successors, (1588), 16 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:09,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:09,989 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:09,989 INFO L186 Difference]: Start difference. First operand has 186 places, 145 transitions, 790 flow. Second operand 16 states and 1588 transitions. [2021-12-07 00:32:09,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 247 transitions, 2173 flow [2021-12-07 00:32:10,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 247 transitions, 1925 flow, removed 83 selfloop flow, removed 14 redundant places. [2021-12-07 00:32:10,079 INFO L242 Difference]: Finished difference. Result has 187 places, 105 transitions, 435 flow [2021-12-07 00:32:10,079 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=435, PETRI_PLACES=187, PETRI_TRANSITIONS=105} [2021-12-07 00:32:10,080 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 65 predicate places. [2021-12-07 00:32:10,080 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 105 transitions, 435 flow [2021-12-07 00:32:10,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:10,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:10,080 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:10,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 00:32:10,080 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-07 00:32:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -640856232, now seen corresponding path program 1 times [2021-12-07 00:32:10,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:10,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869954143] [2021-12-07 00:32:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:10,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:10,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:32:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:10,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:32:10,164 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:32:10,165 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-07 00:32:10,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-07 00:32:10,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-07 00:32:10,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-07 00:32:10,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-07 00:32:10,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-07 00:32:10,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-07 00:32:10,169 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:10,173 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-07 00:32:10,173 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:32:10,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:10 BasicIcfg [2021-12-07 00:32:10,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:32:10,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:32:10,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:32:10,276 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:32:10,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:31:59" (3/4) ... [2021-12-07 00:32:10,278 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 00:32:10,366 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:32:10,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:32:10,367 INFO L158 Benchmark]: Toolchain (without parser) took 11953.04ms. Allocated memory was 104.9MB in the beginning and 438.3MB in the end (delta: 333.4MB). Free memory was 69.7MB in the beginning and 202.4MB in the end (delta: -132.7MB). Peak memory consumption was 199.5MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,367 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 21.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:32:10,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.80ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 68.1MB in the end (delta: 1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.19ms. Allocated memory is still 104.9MB. Free memory was 68.1MB in the beginning and 64.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,368 INFO L158 Benchmark]: Boogie Preprocessor took 25.16ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 62.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,369 INFO L158 Benchmark]: RCFGBuilder took 707.47ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 43.4MB in the end (delta: 19.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,369 INFO L158 Benchmark]: TraceAbstraction took 10717.45ms. Allocated memory was 104.9MB in the beginning and 438.3MB in the end (delta: 333.4MB). Free memory was 42.8MB in the beginning and 231.8MB in the end (delta: -189.0MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,369 INFO L158 Benchmark]: Witness Printer took 90.03ms. Allocated memory is still 438.3MB. Free memory was 231.8MB in the beginning and 202.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-07 00:32:10,372 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.20ms. Allocated memory is still 71.3MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 21.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.80ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 68.1MB in the end (delta: 1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.19ms. Allocated memory is still 104.9MB. Free memory was 68.1MB in the beginning and 64.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.16ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 62.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 707.47ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 43.4MB in the end (delta: 19.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10717.45ms. Allocated memory was 104.9MB in the beginning and 438.3MB in the end (delta: 333.4MB). Free memory was 42.8MB in the beginning and 231.8MB in the end (delta: -189.0MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. * Witness Printer took 90.03ms. Allocated memory is still 438.3MB. Free memory was 231.8MB in the beginning and 202.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 826]: 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: 824]: 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: 828]: 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 7 procedures, 145 locations, 6 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: 10.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 763 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 763 mSDsluCounter, 880 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1260 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2172 IncrementalHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 160 mSDtfsCounter, 2172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=842occurred in iteration=15, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1443 ConstructedInterpolants, 0 QuantifiedInterpolants, 8354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-07 00:32:10,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff76cd31-5461-4802-8711-1ebd14a74f2a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE