./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS --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 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:41:45,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:41:45,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:41:45,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:41:45,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:41:45,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:41:45,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:41:45,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:41:45,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:41:45,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:41:45,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:41:45,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:41:45,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:41:45,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:41:45,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:41:45,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:41:45,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:41:45,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:41:45,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:41:45,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:41:45,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:41:45,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:41:45,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:41:45,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:41:45,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:41:45,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:41:45,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:41:45,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:41:45,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:41:45,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:41:45,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:41:45,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:41:45,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:41:45,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:41:45,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:41:45,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:41:45,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:41:45,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:41:45,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:41:45,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:41:45,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:41:45,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:41:45,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:41:45,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:41:45,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:41:45,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:41:45,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:41:45,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:41:45,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:41:45,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:41:45,883 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:41:45,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:41:45,884 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:41:45,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:41:45,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:41:45,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:41:45,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:41:45,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:41:45,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:41:45,886 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:41:45,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:41:45,886 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:41:45,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:41:45,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:41:45,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:41:45,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:41:45,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:41:45,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:41:45,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:41:45,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:41:45,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:41:45,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:41:45,889 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:41:45,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:41:45,890 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:41:45,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:41:45,890 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/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_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS 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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 [2022-11-23 02:41:46,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:41:46,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:41:46,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:41:46,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:41:46,271 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:41:46,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix008.opt.i [2022-11-23 02:41:49,314 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:41:49,610 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:41:49,611 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/sv-benchmarks/c/pthread-wmm/mix008.opt.i [2022-11-23 02:41:49,626 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/data/475de92c9/a28fa2d9b20845b7bd173637dc21979d/FLAGef47fa1da [2022-11-23 02:41:49,646 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/data/475de92c9/a28fa2d9b20845b7bd173637dc21979d [2022-11-23 02:41:49,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:41:49,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:41:49,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:41:49,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:41:49,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:41:49,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:49" (1/1) ... [2022-11-23 02:41:49,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16dee2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:49, skipping insertion in model container [2022-11-23 02:41:49,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:49" (1/1) ... [2022-11-23 02:41:49,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:41:49,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:41:49,896 WARN L237 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_fc92356f-7d14-4e72-88a7-c3de74f798ed/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957] [2022-11-23 02:41:50,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:41:50,290 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:41:50,306 WARN L237 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_fc92356f-7d14-4e72-88a7-c3de74f798ed/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957] [2022-11-23 02:41:50,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:41:50,397 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:41:50,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50 WrapperNode [2022-11-23 02:41:50,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:41:50,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:41:50,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:41:50,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:41:50,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,506 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-11-23 02:41:50,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:41:50,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:41:50,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:41:50,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:41:50,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,562 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:41:50,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:41:50,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:41:50,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:41:50,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (1/1) ... [2022-11-23 02:41:50,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:41:50,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:41:50,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:41:50,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:41:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:41:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:41:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:41:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:41:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:41:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:41:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:41:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:41:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:41:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:41:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:41:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 02:41:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 02:41:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:41:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:41:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:41:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:41:50,688 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:41:50,884 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:41:50,886 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:41:51,364 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:41:51,543 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:41:51,543 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:41:51,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:51 BoogieIcfgContainer [2022-11-23 02:41:51,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:41:51,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:41:51,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:41:51,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:41:51,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:41:49" (1/3) ... [2022-11-23 02:41:51,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c74c617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:41:51, skipping insertion in model container [2022-11-23 02:41:51,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:50" (2/3) ... [2022-11-23 02:41:51,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c74c617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:41:51, skipping insertion in model container [2022-11-23 02:41:51,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:51" (3/3) ... [2022-11-23 02:41:51,561 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2022-11-23 02:41:51,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:41:51,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:41:51,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:41:51,585 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:41:51,689 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:41:51,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-23 02:41:51,835 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-23 02:41:51,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:41:51,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-23 02:41:51,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-23 02:41:51,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-23 02:41:51,860 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:41:51,894 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-23 02:41:51,896 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-23 02:41:51,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-11-23 02:41:51,992 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-23 02:41:51,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:41:51,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-23 02:41:52,001 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-11-23 02:41:57,283 INFO L134 LiptonReduction]: Checked pairs total: 7710 [2022-11-23 02:41:57,283 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-11-23 02:41:57,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:41:57,307 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28d715ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:41:57,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 02:41:57,314 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-11-23 02:41:57,314 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:41:57,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:41:57,315 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:41:57,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:41:57,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:41:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1989806557, now seen corresponding path program 1 times [2022-11-23 02:41:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:41:57,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127116348] [2022-11-23 02:41:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:41:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:41:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:41:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:41:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:41:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127116348] [2022-11-23 02:41:57,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127116348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:41:57,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:41:57,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:41:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405405606] [2022-11-23 02:41:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:41:57,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:41:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:41:57,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:41:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:41:57,921 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 252 [2022-11-23 02:41:57,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:41:57,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:41:57,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 252 [2022-11-23 02:41:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:41:58,801 INFO L130 PetriNetUnfolder]: 3113/4529 cut-off events. [2022-11-23 02:41:58,801 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-11-23 02:41:58,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 4529 events. 3113/4529 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24244 event pairs, 593 based on Foata normal form. 0/4336 useless extension candidates. Maximal degree in co-relation 8911. Up to 3385 conditions per place. [2022-11-23 02:41:58,840 INFO L137 encePairwiseOnDemand]: 248/252 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2022-11-23 02:41:58,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-11-23 02:41:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:41:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:41:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-11-23 02:41:58,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-11-23 02:41:58,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-11-23 02:41:58,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-11-23 02:41:58,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:41:58,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-11-23 02:41:58,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:41:58,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:41:58,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:41:58,899 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 405 transitions. [2022-11-23 02:41:58,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-11-23 02:41:58,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:41:58,909 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2022-11-23 02:41:58,911 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-11-23 02:41:58,917 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-11-23 02:41:58,917 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2022-11-23 02:41:58,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:41:58,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:41:58,920 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:41:58,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:41:58,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:41:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:41:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash 813481764, now seen corresponding path program 1 times [2022-11-23 02:41:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:41:58,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345689106] [2022-11-23 02:41:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:41:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:41:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:41:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:41:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:41:59,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345689106] [2022-11-23 02:41:59,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345689106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:41:59,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:41:59,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:41:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458911012] [2022-11-23 02:41:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:41:59,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:41:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:41:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:41:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:41:59,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2022-11-23 02:41:59,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:41:59,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:41:59,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2022-11-23 02:41:59,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:02,163 INFO L130 PetriNetUnfolder]: 13983/19192 cut-off events. [2022-11-23 02:42:02,164 INFO L131 PetriNetUnfolder]: For 710/710 co-relation queries the response was YES. [2022-11-23 02:42:02,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39466 conditions, 19192 events. 13983/19192 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 102426 event pairs, 4335 based on Foata normal form. 820/20012 useless extension candidates. Maximal degree in co-relation 39456. Up to 10247 conditions per place. [2022-11-23 02:42:02,327 INFO L137 encePairwiseOnDemand]: 241/252 looper letters, 40 selfloop transitions, 9 changer transitions 31/80 dead transitions. [2022-11-23 02:42:02,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 342 flow [2022-11-23 02:42:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2022-11-23 02:42:02,330 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5015873015873016 [2022-11-23 02:42:02,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2022-11-23 02:42:02,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2022-11-23 02:42:02,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:02,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2022-11-23 02:42:02,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:02,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:02,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:02,341 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 632 transitions. [2022-11-23 02:42:02,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 80 transitions, 342 flow [2022-11-23 02:42:02,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:02,375 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 152 flow [2022-11-23 02:42:02,376 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-11-23 02:42:02,377 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-11-23 02:42:02,377 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 152 flow [2022-11-23 02:42:02,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:02,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:02,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:02,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:42:02,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash -551875933, now seen corresponding path program 1 times [2022-11-23 02:42:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:02,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360177225] [2022-11-23 02:42:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:02,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:02,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360177225] [2022-11-23 02:42:02,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360177225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:02,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:02,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591880864] [2022-11-23 02:42:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:02,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:02,718 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2022-11-23 02:42:02,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:02,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:02,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2022-11-23 02:42:02,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:05,173 INFO L130 PetriNetUnfolder]: 12175/16848 cut-off events. [2022-11-23 02:42:05,173 INFO L131 PetriNetUnfolder]: For 15475/15475 co-relation queries the response was YES. [2022-11-23 02:42:05,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49758 conditions, 16848 events. 12175/16848 cut-off events. For 15475/15475 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 87683 event pairs, 2435 based on Foata normal form. 788/17636 useless extension candidates. Maximal degree in co-relation 49744. Up to 6971 conditions per place. [2022-11-23 02:42:05,281 INFO L137 encePairwiseOnDemand]: 241/252 looper letters, 52 selfloop transitions, 10 changer transitions 46/108 dead transitions. [2022-11-23 02:42:05,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 108 transitions, 680 flow [2022-11-23 02:42:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:42:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-11-23 02:42:05,284 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4914965986394558 [2022-11-23 02:42:05,284 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2022-11-23 02:42:05,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2022-11-23 02:42:05,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:05,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2022-11-23 02:42:05,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:05,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:05,292 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:05,293 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 152 flow. Second operand 7 states and 867 transitions. [2022-11-23 02:42:05,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 108 transitions, 680 flow [2022-11-23 02:42:05,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 108 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:05,367 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 230 flow [2022-11-23 02:42:05,367 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-23 02:42:05,369 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-11-23 02:42:05,369 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 230 flow [2022-11-23 02:42:05,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:05,370 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:05,370 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:05,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:42:05,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 175292688, now seen corresponding path program 1 times [2022-11-23 02:42:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:05,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032218006] [2022-11-23 02:42:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032218006] [2022-11-23 02:42:05,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032218006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:05,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:05,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:42:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214945958] [2022-11-23 02:42:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:05,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:05,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:05,647 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 252 [2022-11-23 02:42:05,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:05,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:05,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 252 [2022-11-23 02:42:05,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:07,732 INFO L130 PetriNetUnfolder]: 8827/12893 cut-off events. [2022-11-23 02:42:07,732 INFO L131 PetriNetUnfolder]: For 28144/28622 co-relation queries the response was YES. [2022-11-23 02:42:07,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40851 conditions, 12893 events. 8827/12893 cut-off events. For 28144/28622 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 75971 event pairs, 3486 based on Foata normal form. 805/13470 useless extension candidates. Maximal degree in co-relation 40831. Up to 9791 conditions per place. [2022-11-23 02:42:07,852 INFO L137 encePairwiseOnDemand]: 247/252 looper letters, 50 selfloop transitions, 6 changer transitions 23/87 dead transitions. [2022-11-23 02:42:07,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 602 flow [2022-11-23 02:42:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2022-11-23 02:42:07,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-11-23 02:42:07,855 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2022-11-23 02:42:07,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2022-11-23 02:42:07,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:07,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2022-11-23 02:42:07,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:07,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:07,862 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:07,862 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 230 flow. Second operand 5 states and 658 transitions. [2022-11-23 02:42:07,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 602 flow [2022-11-23 02:42:07,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 591 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:07,946 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 295 flow [2022-11-23 02:42:07,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-11-23 02:42:07,948 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-11-23 02:42:07,948 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 295 flow [2022-11-23 02:42:07,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:07,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:07,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:07,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:42:07,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1140857821, now seen corresponding path program 1 times [2022-11-23 02:42:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:07,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50843197] [2022-11-23 02:42:07,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:07,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:08,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50843197] [2022-11-23 02:42:08,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50843197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:08,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:08,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442262770] [2022-11-23 02:42:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:08,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:08,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:08,257 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2022-11-23 02:42:08,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:08,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:08,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2022-11-23 02:42:08,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:09,865 INFO L130 PetriNetUnfolder]: 9861/13682 cut-off events. [2022-11-23 02:42:09,865 INFO L131 PetriNetUnfolder]: For 26913/26913 co-relation queries the response was YES. [2022-11-23 02:42:09,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46131 conditions, 13682 events. 9861/13682 cut-off events. For 26913/26913 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 70048 event pairs, 1883 based on Foata normal form. 480/14162 useless extension candidates. Maximal degree in co-relation 46108. Up to 5393 conditions per place. [2022-11-23 02:42:09,983 INFO L137 encePairwiseOnDemand]: 242/252 looper letters, 68 selfloop transitions, 16 changer transitions 38/122 dead transitions. [2022-11-23 02:42:09,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 122 transitions, 936 flow [2022-11-23 02:42:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:42:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-11-23 02:42:09,988 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4909297052154195 [2022-11-23 02:42:09,988 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2022-11-23 02:42:09,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2022-11-23 02:42:09,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:09,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2022-11-23 02:42:09,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:09,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:09,997 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:09,998 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 295 flow. Second operand 7 states and 866 transitions. [2022-11-23 02:42:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 122 transitions, 936 flow [2022-11-23 02:42:10,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 122 transitions, 897 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-11-23 02:42:10,158 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 450 flow [2022-11-23 02:42:10,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=450, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-11-23 02:42:10,161 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-11-23 02:42:10,161 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 450 flow [2022-11-23 02:42:10,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:10,162 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:10,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:42:10,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1655175198, now seen corresponding path program 1 times [2022-11-23 02:42:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:10,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533628868] [2022-11-23 02:42:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:10,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533628868] [2022-11-23 02:42:10,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533628868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:10,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:10,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:42:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075962213] [2022-11-23 02:42:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:10,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:10,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:10,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2022-11-23 02:42:10,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:10,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:10,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2022-11-23 02:42:10,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:11,282 INFO L130 PetriNetUnfolder]: 4492/6687 cut-off events. [2022-11-23 02:42:11,282 INFO L131 PetriNetUnfolder]: For 18354/19638 co-relation queries the response was YES. [2022-11-23 02:42:11,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22776 conditions, 6687 events. 4492/6687 cut-off events. For 18354/19638 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 37954 event pairs, 942 based on Foata normal form. 396/6778 useless extension candidates. Maximal degree in co-relation 22749. Up to 5654 conditions per place. [2022-11-23 02:42:11,335 INFO L137 encePairwiseOnDemand]: 246/252 looper letters, 58 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2022-11-23 02:42:11,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 747 flow [2022-11-23 02:42:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:42:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2022-11-23 02:42:11,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5224867724867724 [2022-11-23 02:42:11,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2022-11-23 02:42:11,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2022-11-23 02:42:11,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:11,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2022-11-23 02:42:11,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,342 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 450 flow. Second operand 3 states and 395 transitions. [2022-11-23 02:42:11,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 747 flow [2022-11-23 02:42:11,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 737 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:11,401 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 473 flow [2022-11-23 02:42:11,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-11-23 02:42:11,402 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2022-11-23 02:42:11,402 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 473 flow [2022-11-23 02:42:11,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:11,403 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:11,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:42:11,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash -670299300, now seen corresponding path program 1 times [2022-11-23 02:42:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:11,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299700821] [2022-11-23 02:42:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:11,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:11,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299700821] [2022-11-23 02:42:11,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299700821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:11,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:11,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878803733] [2022-11-23 02:42:11,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:11,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:11,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:11,618 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 252 [2022-11-23 02:42:11,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:11,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 252 [2022-11-23 02:42:11,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:13,153 INFO L130 PetriNetUnfolder]: 6580/10018 cut-off events. [2022-11-23 02:42:13,153 INFO L131 PetriNetUnfolder]: For 27756/28690 co-relation queries the response was YES. [2022-11-23 02:42:13,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38268 conditions, 10018 events. 6580/10018 cut-off events. For 27756/28690 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 61135 event pairs, 2538 based on Foata normal form. 317/10035 useless extension candidates. Maximal degree in co-relation 38240. Up to 4939 conditions per place. [2022-11-23 02:42:13,229 INFO L137 encePairwiseOnDemand]: 248/252 looper letters, 61 selfloop transitions, 12 changer transitions 20/104 dead transitions. [2022-11-23 02:42:13,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 900 flow [2022-11-23 02:42:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-11-23 02:42:13,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2022-11-23 02:42:13,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-11-23 02:42:13,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-11-23 02:42:13,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:13,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-11-23 02:42:13,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:13,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:13,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:13,239 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 473 flow. Second operand 5 states and 654 transitions. [2022-11-23 02:42:13,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 900 flow [2022-11-23 02:42:13,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 881 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:13,362 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 466 flow [2022-11-23 02:42:13,363 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-11-23 02:42:13,363 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-11-23 02:42:13,364 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 466 flow [2022-11-23 02:42:13,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:13,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:13,368 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:13,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:42:13,369 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1067685821, now seen corresponding path program 1 times [2022-11-23 02:42:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:13,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74575947] [2022-11-23 02:42:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:13,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74575947] [2022-11-23 02:42:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74575947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:13,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726172550] [2022-11-23 02:42:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:13,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:13,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2022-11-23 02:42:13,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 466 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:13,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:13,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2022-11-23 02:42:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:14,491 INFO L130 PetriNetUnfolder]: 3013/4822 cut-off events. [2022-11-23 02:42:14,492 INFO L131 PetriNetUnfolder]: For 12325/13156 co-relation queries the response was YES. [2022-11-23 02:42:14,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18022 conditions, 4822 events. 3013/4822 cut-off events. For 12325/13156 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 28841 event pairs, 402 based on Foata normal form. 518/5115 useless extension candidates. Maximal degree in co-relation 17993. Up to 2749 conditions per place. [2022-11-23 02:42:14,528 INFO L137 encePairwiseOnDemand]: 246/252 looper letters, 79 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2022-11-23 02:42:14,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 106 transitions, 991 flow [2022-11-23 02:42:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:42:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2022-11-23 02:42:14,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-11-23 02:42:14,535 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2022-11-23 02:42:14,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2022-11-23 02:42:14,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:14,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2022-11-23 02:42:14,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:14,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:14,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:14,543 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 466 flow. Second operand 4 states and 528 transitions. [2022-11-23 02:42:14,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 106 transitions, 991 flow [2022-11-23 02:42:14,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 950 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-11-23 02:42:14,580 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 496 flow [2022-11-23 02:42:14,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=496, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2022-11-23 02:42:14,583 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-11-23 02:42:14,584 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 496 flow [2022-11-23 02:42:14,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:14,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:14,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:14,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:42:14,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash -118122324, now seen corresponding path program 1 times [2022-11-23 02:42:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:14,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505457599] [2022-11-23 02:42:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:14,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505457599] [2022-11-23 02:42:14,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505457599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:14,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:14,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:14,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610221390] [2022-11-23 02:42:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:14,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:14,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2022-11-23 02:42:14,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:14,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:14,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2022-11-23 02:42:14,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:15,700 INFO L130 PetriNetUnfolder]: 2066/3324 cut-off events. [2022-11-23 02:42:15,701 INFO L131 PetriNetUnfolder]: For 9464/10307 co-relation queries the response was YES. [2022-11-23 02:42:15,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14087 conditions, 3324 events. 2066/3324 cut-off events. For 9464/10307 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19214 event pairs, 214 based on Foata normal form. 470/3608 useless extension candidates. Maximal degree in co-relation 14058. Up to 1225 conditions per place. [2022-11-23 02:42:15,723 INFO L137 encePairwiseOnDemand]: 246/252 looper letters, 92 selfloop transitions, 13 changer transitions 0/123 dead transitions. [2022-11-23 02:42:15,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 123 transitions, 1130 flow [2022-11-23 02:42:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-11-23 02:42:15,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.523015873015873 [2022-11-23 02:42:15,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2022-11-23 02:42:15,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2022-11-23 02:42:15,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:15,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2022-11-23 02:42:15,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,733 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 496 flow. Second operand 5 states and 659 transitions. [2022-11-23 02:42:15,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 123 transitions, 1130 flow [2022-11-23 02:42:15,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 123 transitions, 1110 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-23 02:42:15,759 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 544 flow [2022-11-23 02:42:15,760 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2022-11-23 02:42:15,760 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2022-11-23 02:42:15,761 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 544 flow [2022-11-23 02:42:15,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:15,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:15,761 INFO L209 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] [2022-11-23 02:42:15,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:42:15,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2077016621, now seen corresponding path program 1 times [2022-11-23 02:42:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:15,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273711899] [2022-11-23 02:42:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273711899] [2022-11-23 02:42:16,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273711899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:16,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:16,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:42:16,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582408533] [2022-11-23 02:42:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:16,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:42:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:42:16,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:42:16,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2022-11-23 02:42:16,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:16,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2022-11-23 02:42:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:16,810 INFO L130 PetriNetUnfolder]: 1962/3091 cut-off events. [2022-11-23 02:42:16,810 INFO L131 PetriNetUnfolder]: For 10043/10872 co-relation queries the response was YES. [2022-11-23 02:42:16,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13461 conditions, 3091 events. 1962/3091 cut-off events. For 10043/10872 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17601 event pairs, 199 based on Foata normal form. 324/3230 useless extension candidates. Maximal degree in co-relation 13431. Up to 1179 conditions per place. [2022-11-23 02:42:16,837 INFO L137 encePairwiseOnDemand]: 246/252 looper letters, 80 selfloop transitions, 17 changer transitions 11/123 dead transitions. [2022-11-23 02:42:16,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1154 flow [2022-11-23 02:42:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:42:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:42:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2022-11-23 02:42:16,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-11-23 02:42:16,840 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2022-11-23 02:42:16,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2022-11-23 02:42:16,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:16,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2022-11-23 02:42:16,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,848 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 544 flow. Second operand 6 states and 777 transitions. [2022-11-23 02:42:16,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1154 flow [2022-11-23 02:42:16,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 1088 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-11-23 02:42:16,926 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 486 flow [2022-11-23 02:42:16,926 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2022-11-23 02:42:16,927 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2022-11-23 02:42:16,927 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 486 flow [2022-11-23 02:42:16,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,928 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:16,928 INFO L209 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] [2022-11-23 02:42:16,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:42:16,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1558062133, now seen corresponding path program 1 times [2022-11-23 02:42:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:16,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530290519] [2022-11-23 02:42:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:17,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:17,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530290519] [2022-11-23 02:42:17,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530290519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:17,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:17,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759258672] [2022-11-23 02:42:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:17,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:17,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:17,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:17,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:17,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2022-11-23 02:42:17,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:17,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:17,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2022-11-23 02:42:17,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:17,832 INFO L130 PetriNetUnfolder]: 1170/1967 cut-off events. [2022-11-23 02:42:17,832 INFO L131 PetriNetUnfolder]: For 7331/7481 co-relation queries the response was YES. [2022-11-23 02:42:17,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9092 conditions, 1967 events. 1170/1967 cut-off events. For 7331/7481 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10314 event pairs, 171 based on Foata normal form. 32/1959 useless extension candidates. Maximal degree in co-relation 9065. Up to 1152 conditions per place. [2022-11-23 02:42:17,845 INFO L137 encePairwiseOnDemand]: 248/252 looper letters, 44 selfloop transitions, 1 changer transitions 54/105 dead transitions. [2022-11-23 02:42:17,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 988 flow [2022-11-23 02:42:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2022-11-23 02:42:17,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2022-11-23 02:42:17,848 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2022-11-23 02:42:17,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2022-11-23 02:42:17,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:17,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2022-11-23 02:42:17,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:17,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:17,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:17,855 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 486 flow. Second operand 5 states and 640 transitions. [2022-11-23 02:42:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 988 flow [2022-11-23 02:42:17,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 827 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-11-23 02:42:17,896 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 296 flow [2022-11-23 02:42:17,896 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2022-11-23 02:42:17,897 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-11-23 02:42:17,897 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 296 flow [2022-11-23 02:42:17,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:17,897 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:17,897 INFO L209 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] [2022-11-23 02:42:17,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:42:17,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1501301503, now seen corresponding path program 2 times [2022-11-23 02:42:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:17,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001892371] [2022-11-23 02:42:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:18,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:18,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001892371] [2022-11-23 02:42:18,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001892371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:18,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:18,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315988671] [2022-11-23 02:42:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:18,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:18,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:18,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:18,306 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2022-11-23 02:42:18,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:18,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:18,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2022-11-23 02:42:18,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:18,617 INFO L130 PetriNetUnfolder]: 554/956 cut-off events. [2022-11-23 02:42:18,617 INFO L131 PetriNetUnfolder]: For 2386/2386 co-relation queries the response was YES. [2022-11-23 02:42:18,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3878 conditions, 956 events. 554/956 cut-off events. For 2386/2386 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4182 event pairs, 99 based on Foata normal form. 1/957 useless extension candidates. Maximal degree in co-relation 3860. Up to 548 conditions per place. [2022-11-23 02:42:18,623 INFO L137 encePairwiseOnDemand]: 242/252 looper letters, 48 selfloop transitions, 6 changer transitions 32/86 dead transitions. [2022-11-23 02:42:18,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 679 flow [2022-11-23 02:42:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:42:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:42:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-11-23 02:42:18,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-11-23 02:42:18,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2022-11-23 02:42:18,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2022-11-23 02:42:18,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:18,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2022-11-23 02:42:18,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:18,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:18,633 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:18,633 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 296 flow. Second operand 5 states and 602 transitions. [2022-11-23 02:42:18,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 679 flow [2022-11-23 02:42:18,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 650 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-23 02:42:18,647 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 218 flow [2022-11-23 02:42:18,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2022-11-23 02:42:18,648 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-11-23 02:42:18,648 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 218 flow [2022-11-23 02:42:18,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:18,649 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:18,649 INFO L209 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] [2022-11-23 02:42:18,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:42:18,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1144662943, now seen corresponding path program 3 times [2022-11-23 02:42:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:18,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649499006] [2022-11-23 02:42:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:42:20,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649499006] [2022-11-23 02:42:20,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649499006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:20,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:20,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 02:42:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900342811] [2022-11-23 02:42:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:20,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:42:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:42:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:42:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:42:21,064 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 252 [2022-11-23 02:42:21,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 218 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:42:21,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 252 [2022-11-23 02:42:21,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:42:21,735 INFO L130 PetriNetUnfolder]: 116/244 cut-off events. [2022-11-23 02:42:21,735 INFO L131 PetriNetUnfolder]: For 418/423 co-relation queries the response was YES. [2022-11-23 02:42:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 244 events. 116/244 cut-off events. For 418/423 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 816 event pairs, 20 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 957. Up to 95 conditions per place. [2022-11-23 02:42:21,736 INFO L137 encePairwiseOnDemand]: 244/252 looper letters, 39 selfloop transitions, 5 changer transitions 25/73 dead transitions. [2022-11-23 02:42:21,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 553 flow [2022-11-23 02:42:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:42:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:42:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2022-11-23 02:42:21,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47001763668430335 [2022-11-23 02:42:21,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1066 transitions. [2022-11-23 02:42:21,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1066 transitions. [2022-11-23 02:42:21,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:42:21,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1066 transitions. [2022-11-23 02:42:21,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,749 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 252.0) internal successors, (2520), 10 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,749 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 218 flow. Second operand 9 states and 1066 transitions. [2022-11-23 02:42:21,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 553 flow [2022-11-23 02:42:21,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 478 flow, removed 12 selfloop flow, removed 12 redundant places. [2022-11-23 02:42:21,753 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 182 flow [2022-11-23 02:42:21,754 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2022-11-23 02:42:21,754 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2022-11-23 02:42:21,754 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 182 flow [2022-11-23 02:42:21,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:21,755 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:42:21,755 INFO L209 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] [2022-11-23 02:42:21,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:42:21,756 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:42:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 992430775, now seen corresponding path program 4 times [2022-11-23 02:42:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:42:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447220879] [2022-11-23 02:42:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:42:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:21,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:42:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:42:21,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:42:21,888 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:42:21,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 02:42:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 02:42:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 02:42:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 02:42:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 02:42:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 02:42:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 02:42:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 02:42:21,893 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:21,899 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:42:21,899 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:42:21,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:42:21 BasicIcfg [2022-11-23 02:42:21,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:42:21,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:42:21,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:42:21,978 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:42:21,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:51" (3/4) ... [2022-11-23 02:42:21,981 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:42:22,098 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:42:22,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:42:22,099 INFO L158 Benchmark]: Toolchain (without parser) took 32448.02ms. Allocated memory was 151.0MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 119.0MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 739.9MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,099 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:42:22,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.03ms. Allocated memory is still 151.0MB. Free memory was 118.6MB in the beginning and 94.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.38ms. Allocated memory is still 151.0MB. Free memory was 94.6MB in the beginning and 91.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,100 INFO L158 Benchmark]: Boogie Preprocessor took 60.08ms. Allocated memory is still 151.0MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,101 INFO L158 Benchmark]: RCFGBuilder took 977.66ms. Allocated memory is still 151.0MB. Free memory was 89.7MB in the beginning and 91.8MB in the end (delta: -2.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,101 INFO L158 Benchmark]: TraceAbstraction took 30429.41ms. Allocated memory was 151.0MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 91.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 698.2MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,101 INFO L158 Benchmark]: Witness Printer took 120.50ms. Allocated memory is still 3.2GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 02:42:22,103 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.22ms. Allocated memory is still 117.4MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.03ms. Allocated memory is still 151.0MB. Free memory was 118.6MB in the beginning and 94.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.38ms. Allocated memory is still 151.0MB. Free memory was 94.6MB in the beginning and 91.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.08ms. Allocated memory is still 151.0MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 977.66ms. Allocated memory is still 151.0MB. Free memory was 89.7MB in the beginning and 91.8MB in the end (delta: -2.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30429.41ms. Allocated memory was 151.0MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 91.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 698.2MB. Max. memory is 16.1GB. * Witness Printer took 120.50ms. Allocated memory is still 3.2GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 143 PlacesBefore, 42 PlacesAfterwards, 132 TransitionsBefore, 30 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 7710 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3845, independent: 3643, independent conditional: 0, independent unconditional: 3643, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2138, independent: 2085, independent conditional: 0, independent unconditional: 2085, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2138, independent: 2056, independent conditional: 0, independent unconditional: 2056, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 355, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3845, independent: 1558, independent conditional: 0, independent unconditional: 1558, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 2138, unknown conditional: 0, unknown unconditional: 2138] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-3, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=-2, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=-1, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 872]: 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: 870]: 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 686 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1601 IncrementalHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 55 mSDtfsCounter, 1601 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=9, InterpolantAutomatonStates: 69, 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.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [2022-11-23 02:42:22,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc92356f-7d14-4e72-88a7-c3de74f798ed/bin/uautomizer-QkZJyEgLgS/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