./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN --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 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- 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-6b4ec56 [2022-11-20 09:31:12,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:31:12,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:31:12,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:31:12,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:31:12,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:31:12,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:31:12,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:31:12,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:31:12,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:31:12,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:31:12,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:31:12,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:31:12,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:31:12,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:31:12,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:31:12,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:31:12,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:31:12,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:31:12,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:31:12,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:31:12,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:31:13,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:31:13,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:31:13,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:31:13,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:31:13,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:31:13,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:31:13,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:31:13,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:31:13,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:31:13,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:31:13,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:31:13,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:31:13,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:31:13,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:31:13,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:31:13,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:31:13,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:31:13,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:31:13,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:31:13,055 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:31:13,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:31:13,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:31:13,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:31:13,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:31:13,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:31:13,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:31:13,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:31:13,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:31:13,094 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:31:13,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:31:13,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:31:13,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:31:13,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:31:13,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:31:13,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:31:13,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:31:13,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:31:13,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:31:13,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:31:13,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:31:13,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:31:13,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:31:13,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:31:13,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:31:13,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:13,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:31:13,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:31:13,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:31:13,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:31:13,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:31:13,100 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:31:13,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:31:13,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:31:13,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/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_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN 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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2022-11-20 09:31:13,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:31:13,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:31:13,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:31:13,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:31:13,470 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:31:13,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2022-11-20 09:31:16,635 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:31:16,958 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:31:16,959 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2022-11-20 09:31:16,972 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/data/89e6b2c77/b8c5530d4acf4499b076f0e62420e7c0/FLAGedea65dd9 [2022-11-20 09:31:16,997 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/data/89e6b2c77/b8c5530d4acf4499b076f0e62420e7c0 [2022-11-20 09:31:17,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:31:17,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:31:17,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:17,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:31:17,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:31:17,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:16" (1/1) ... [2022-11-20 09:31:17,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ed6ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17, skipping insertion in model container [2022-11-20 09:31:17,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:16" (1/1) ... [2022-11-20 09:31:17,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:31:17,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:31:17,255 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_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2022-11-20 09:31:17,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:17,604 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:31:17,620 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_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2022-11-20 09:31:17,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:17,731 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:31:17,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17 WrapperNode [2022-11-20 09:31:17,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:17,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:17,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:31:17,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:31:17,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,829 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-20 09:31:17,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:17,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:31:17,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:31:17,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:31:17,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,886 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:31:17,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:31:17,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:31:17,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:31:17,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (1/1) ... [2022-11-20 09:31:17,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:17,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:31:17,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:31:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:31:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:31:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:31:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:31:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:31:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:31:17,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:31:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:31:17,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:31:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:31:17,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:31:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:31:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:31:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:31:17,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:31:17,999 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:31:18,138 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:31:18,140 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:31:18,543 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:31:18,808 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:31:18,809 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:31:18,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:18 BoogieIcfgContainer [2022-11-20 09:31:18,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:31:18,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:31:18,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:31:18,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:31:18,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:31:16" (1/3) ... [2022-11-20 09:31:18,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc6c99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:18, skipping insertion in model container [2022-11-20 09:31:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:17" (2/3) ... [2022-11-20 09:31:18,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc6c99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:18, skipping insertion in model container [2022-11-20 09:31:18,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:18" (3/3) ... [2022-11-20 09:31:18,831 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2022-11-20 09:31:18,840 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:31:18,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:31:18,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 09:31:18,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:31:18,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:31:18,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-20 09:31:19,003 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-20 09:31:19,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:31:19,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-20 09:31:19,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-20 09:31:19,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-20 09:31:19,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:31:19,033 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;@fa25878, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:31:19,034 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 09:31:19,051 INFO L130 PetriNetUnfolder]: 0/59 cut-off events. [2022-11-20 09:31:19,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:31:19,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:19,053 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, 1, 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-20 09:31:19,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1497240568, now seen corresponding path program 1 times [2022-11-20 09:31:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:19,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910541345] [2022-11-20 09:31:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,907 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-20 09:31:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910541345] [2022-11-20 09:31:19,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910541345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:19,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:19,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828072162] [2022-11-20 09:31:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:19,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:19,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:19,970 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2022-11-20 09:31:19,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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-20 09:31:19,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:19,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2022-11-20 09:31:19,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:20,166 INFO L130 PetriNetUnfolder]: 57/324 cut-off events. [2022-11-20 09:31:20,167 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-20 09:31:20,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 324 events. 57/324 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1320 event pairs, 11 based on Foata normal form. 12/319 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2022-11-20 09:31:20,176 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 13 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-20 09:31:20,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 268 flow [2022-11-20 09:31:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:31:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-11-20 09:31:20,193 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.936231884057971 [2022-11-20 09:31:20,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2022-11-20 09:31:20,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2022-11-20 09:31:20,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:20,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2022-11-20 09:31:20,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-20 09:31:20,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-20 09:31:20,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-20 09:31:20,218 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 323 transitions. [2022-11-20 09:31:20,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 268 flow [2022-11-20 09:31:20,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 09:31:20,225 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-11-20 09:31:20,228 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-11-20 09:31:20,232 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-11-20 09:31:20,232 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-11-20 09:31:20,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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-20 09:31:20,233 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:20,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:20,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:31:20,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1018853591, now seen corresponding path program 1 times [2022-11-20 09:31:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:20,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221167028] [2022-11-20 09:31:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:22,182 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-20 09:31:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:22,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221167028] [2022-11-20 09:31:22,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221167028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:22,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:22,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 09:31:22,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985086233] [2022-11-20 09:31:22,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:22,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 09:31:22,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 09:31:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:31:22,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2022-11-20 09:31:22,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 11 states, 11 states have (on average 85.72727272727273) internal successors, (943), 11 states have internal predecessors, (943), 0 states have call successors, (0), 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-20 09:31:22,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:22,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2022-11-20 09:31:22,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:23,767 INFO L130 PetriNetUnfolder]: 952/2630 cut-off events. [2022-11-20 09:31:23,767 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-11-20 09:31:23,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 2630 events. 952/2630 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 20219 event pairs, 243 based on Foata normal form. 0/2551 useless extension candidates. Maximal degree in co-relation 4183. Up to 828 conditions per place. [2022-11-20 09:31:23,787 INFO L137 encePairwiseOnDemand]: 100/115 looper letters, 32 selfloop transitions, 16 changer transitions 90/208 dead transitions. [2022-11-20 09:31:23,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 208 transitions, 712 flow [2022-11-20 09:31:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 09:31:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 09:31:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1727 transitions. [2022-11-20 09:31:23,797 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7903890160183067 [2022-11-20 09:31:23,798 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1727 transitions. [2022-11-20 09:31:23,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1727 transitions. [2022-11-20 09:31:23,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:23,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1727 transitions. [2022-11-20 09:31:23,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 90.89473684210526) internal successors, (1727), 19 states have internal predecessors, (1727), 0 states have call successors, (0), 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-20 09:31:23,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 115.0) internal successors, (2300), 20 states have internal predecessors, (2300), 0 states have call successors, (0), 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-20 09:31:23,814 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 115.0) internal successors, (2300), 20 states have internal predecessors, (2300), 0 states have call successors, (0), 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-20 09:31:23,815 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 19 states and 1727 transitions. [2022-11-20 09:31:23,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 208 transitions, 712 flow [2022-11-20 09:31:23,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 208 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:31:23,824 INFO L231 Difference]: Finished difference. Result has 148 places, 108 transitions, 349 flow [2022-11-20 09:31:23,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=349, PETRI_PLACES=148, PETRI_TRANSITIONS=108} [2022-11-20 09:31:23,826 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 28 predicate places. [2022-11-20 09:31:23,827 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 108 transitions, 349 flow [2022-11-20 09:31:23,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.72727272727273) internal successors, (943), 11 states have internal predecessors, (943), 0 states have call successors, (0), 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-20 09:31:23,829 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:23,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:23,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:31:23,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -829338087, now seen corresponding path program 1 times [2022-11-20 09:31:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:23,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94576880] [2022-11-20 09:31:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:25,053 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-20 09:31:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94576880] [2022-11-20 09:31:25,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94576880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:25,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:25,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:31:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861534311] [2022-11-20 09:31:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:25,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:31:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:25,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:31:25,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:31:25,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-20 09:31:25,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 108 transitions, 349 flow. Second operand has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 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-20 09:31:25,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:25,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-20 09:31:25,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:26,137 INFO L130 PetriNetUnfolder]: 445/1071 cut-off events. [2022-11-20 09:31:26,137 INFO L131 PetriNetUnfolder]: For 4464/4681 co-relation queries the response was YES. [2022-11-20 09:31:26,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4348 conditions, 1071 events. 445/1071 cut-off events. For 4464/4681 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6298 event pairs, 160 based on Foata normal form. 46/1072 useless extension candidates. Maximal degree in co-relation 4272. Up to 392 conditions per place. [2022-11-20 09:31:26,150 INFO L137 encePairwiseOnDemand]: 102/115 looper letters, 37 selfloop transitions, 22 changer transitions 58/193 dead transitions. [2022-11-20 09:31:26,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 193 transitions, 1348 flow [2022-11-20 09:31:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:31:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 09:31:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1973 transitions. [2022-11-20 09:31:26,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8169772256728779 [2022-11-20 09:31:26,158 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1973 transitions. [2022-11-20 09:31:26,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1973 transitions. [2022-11-20 09:31:26,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:26,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1973 transitions. [2022-11-20 09:31:26,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 93.95238095238095) internal successors, (1973), 21 states have internal predecessors, (1973), 0 states have call successors, (0), 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-20 09:31:26,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 115.0) internal successors, (2530), 22 states have internal predecessors, (2530), 0 states have call successors, (0), 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-20 09:31:26,174 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 115.0) internal successors, (2530), 22 states have internal predecessors, (2530), 0 states have call successors, (0), 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-20 09:31:26,174 INFO L175 Difference]: Start difference. First operand has 148 places, 108 transitions, 349 flow. Second operand 21 states and 1973 transitions. [2022-11-20 09:31:26,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 193 transitions, 1348 flow [2022-11-20 09:31:26,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 193 transitions, 1300 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-11-20 09:31:26,196 INFO L231 Difference]: Finished difference. Result has 152 places, 124 transitions, 618 flow [2022-11-20 09:31:26,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=618, PETRI_PLACES=152, PETRI_TRANSITIONS=124} [2022-11-20 09:31:26,199 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 32 predicate places. [2022-11-20 09:31:26,199 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 124 transitions, 618 flow [2022-11-20 09:31:26,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 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-20 09:31:26,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:26,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:26,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:31:26,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 91134677, now seen corresponding path program 1 times [2022-11-20 09:31:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:26,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987350211] [2022-11-20 09:31:26,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:27,310 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-20 09:31:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:27,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987350211] [2022-11-20 09:31:27,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987350211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:27,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:27,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 09:31:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006070889] [2022-11-20 09:31:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:27,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 09:31:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 09:31:27,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:31:27,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 115 [2022-11-20 09:31:27,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 124 transitions, 618 flow. Second operand has 12 states, 12 states have (on average 84.83333333333333) internal successors, (1018), 12 states have internal predecessors, (1018), 0 states have call successors, (0), 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-20 09:31:27,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:27,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 115 [2022-11-20 09:31:27,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:28,241 INFO L130 PetriNetUnfolder]: 560/1253 cut-off events. [2022-11-20 09:31:28,241 INFO L131 PetriNetUnfolder]: For 9157/9507 co-relation queries the response was YES. [2022-11-20 09:31:28,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 1253 events. 560/1253 cut-off events. For 9157/9507 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7142 event pairs, 111 based on Foata normal form. 47/1244 useless extension candidates. Maximal degree in co-relation 6011. Up to 470 conditions per place. [2022-11-20 09:31:28,260 INFO L137 encePairwiseOnDemand]: 101/115 looper letters, 54 selfloop transitions, 23 changer transitions 53/199 dead transitions. [2022-11-20 09:31:28,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 199 transitions, 1691 flow [2022-11-20 09:31:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 09:31:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-20 09:31:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1603 transitions. [2022-11-20 09:31:28,265 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7743961352657005 [2022-11-20 09:31:28,265 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1603 transitions. [2022-11-20 09:31:28,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1603 transitions. [2022-11-20 09:31:28,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:28,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1603 transitions. [2022-11-20 09:31:28,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 89.05555555555556) internal successors, (1603), 18 states have internal predecessors, (1603), 0 states have call successors, (0), 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-20 09:31:28,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 115.0) internal successors, (2185), 19 states have internal predecessors, (2185), 0 states have call successors, (0), 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-20 09:31:28,326 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 115.0) internal successors, (2185), 19 states have internal predecessors, (2185), 0 states have call successors, (0), 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-20 09:31:28,326 INFO L175 Difference]: Start difference. First operand has 152 places, 124 transitions, 618 flow. Second operand 18 states and 1603 transitions. [2022-11-20 09:31:28,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 199 transitions, 1691 flow [2022-11-20 09:31:28,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 199 transitions, 1599 flow, removed 43 selfloop flow, removed 9 redundant places. [2022-11-20 09:31:28,353 INFO L231 Difference]: Finished difference. Result has 160 places, 131 transitions, 774 flow [2022-11-20 09:31:28,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=774, PETRI_PLACES=160, PETRI_TRANSITIONS=131} [2022-11-20 09:31:28,355 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places. [2022-11-20 09:31:28,360 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 131 transitions, 774 flow [2022-11-20 09:31:28,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.83333333333333) internal successors, (1018), 12 states have internal predecessors, (1018), 0 states have call successors, (0), 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-20 09:31:28,362 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:28,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:28,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:31:28,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1459161368, now seen corresponding path program 1 times [2022-11-20 09:31:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:28,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740851993] [2022-11-20 09:31:28,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:28,649 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-20 09:31:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740851993] [2022-11-20 09:31:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740851993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:28,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:28,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:31:28,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689365055] [2022-11-20 09:31:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:28,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:31:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:31:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:28,653 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-11-20 09:31:28,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 131 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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-20 09:31:28,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:28,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-11-20 09:31:28,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:29,677 INFO L130 PetriNetUnfolder]: 1394/2681 cut-off events. [2022-11-20 09:31:29,678 INFO L131 PetriNetUnfolder]: For 37888/38637 co-relation queries the response was YES. [2022-11-20 09:31:29,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13867 conditions, 2681 events. 1394/2681 cut-off events. For 37888/38637 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17402 event pairs, 87 based on Foata normal form. 69/2665 useless extension candidates. Maximal degree in co-relation 13775. Up to 752 conditions per place. [2022-11-20 09:31:29,729 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 105 selfloop transitions, 15 changer transitions 58/259 dead transitions. [2022-11-20 09:31:29,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 259 transitions, 2655 flow [2022-11-20 09:31:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:31:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 09:31:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2022-11-20 09:31:29,733 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8626086956521739 [2022-11-20 09:31:29,734 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2022-11-20 09:31:29,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2022-11-20 09:31:29,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:29,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2022-11-20 09:31:29,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 0 states have call successors, (0), 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-20 09:31:29,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-20 09:31:29,741 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 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-20 09:31:29,741 INFO L175 Difference]: Start difference. First operand has 160 places, 131 transitions, 774 flow. Second operand 10 states and 992 transitions. [2022-11-20 09:31:29,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 259 transitions, 2655 flow [2022-11-20 09:31:29,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 259 transitions, 2264 flow, removed 144 selfloop flow, removed 16 redundant places. [2022-11-20 09:31:29,797 INFO L231 Difference]: Finished difference. Result has 150 places, 137 transitions, 702 flow [2022-11-20 09:31:29,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=702, PETRI_PLACES=150, PETRI_TRANSITIONS=137} [2022-11-20 09:31:29,798 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 30 predicate places. [2022-11-20 09:31:29,798 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 137 transitions, 702 flow [2022-11-20 09:31:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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-20 09:31:29,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:29,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:29,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:31:29,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1514340953, now seen corresponding path program 1 times [2022-11-20 09:31:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:29,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244634980] [2022-11-20 09:31:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:30,090 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-20 09:31:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:30,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244634980] [2022-11-20 09:31:30,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244634980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:30,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:30,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:31:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618298287] [2022-11-20 09:31:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:30,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:31:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:31:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:30,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-11-20 09:31:30,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 137 transitions, 702 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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-20 09:31:30,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:30,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-11-20 09:31:30,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:31,062 INFO L130 PetriNetUnfolder]: 1123/2335 cut-off events. [2022-11-20 09:31:31,070 INFO L131 PetriNetUnfolder]: For 26562/26897 co-relation queries the response was YES. [2022-11-20 09:31:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11568 conditions, 2335 events. 1123/2335 cut-off events. For 26562/26897 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15967 event pairs, 48 based on Foata normal form. 101/2408 useless extension candidates. Maximal degree in co-relation 11482. Up to 533 conditions per place. [2022-11-20 09:31:31,100 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 103 selfloop transitions, 30 changer transitions 64/278 dead transitions. [2022-11-20 09:31:31,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 278 transitions, 2677 flow [2022-11-20 09:31:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:31:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:31:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1290 transitions. [2022-11-20 09:31:31,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.862876254180602 [2022-11-20 09:31:31,105 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1290 transitions. [2022-11-20 09:31:31,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1290 transitions. [2022-11-20 09:31:31,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:31,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1290 transitions. [2022-11-20 09:31:31,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.23076923076923) internal successors, (1290), 13 states have internal predecessors, (1290), 0 states have call successors, (0), 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-20 09:31:31,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 0 states have call successors, (0), 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-20 09:31:31,113 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 0 states have call successors, (0), 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-20 09:31:31,113 INFO L175 Difference]: Start difference. First operand has 150 places, 137 transitions, 702 flow. Second operand 13 states and 1290 transitions. [2022-11-20 09:31:31,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 278 transitions, 2677 flow [2022-11-20 09:31:31,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 278 transitions, 2487 flow, removed 72 selfloop flow, removed 6 redundant places. [2022-11-20 09:31:31,177 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 879 flow [2022-11-20 09:31:31,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=879, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2022-11-20 09:31:31,180 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places. [2022-11-20 09:31:31,180 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 879 flow [2022-11-20 09:31:31,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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-20 09:31:31,182 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:31,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:31,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:31:31,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:31,183 INFO L85 PathProgramCache]: Analyzing trace with hash -371616342, now seen corresponding path program 1 times [2022-11-20 09:31:31,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:31,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942387622] [2022-11-20 09:31:31,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:31,547 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-20 09:31:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:31,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942387622] [2022-11-20 09:31:31,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942387622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:31,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:31,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:31:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410219314] [2022-11-20 09:31:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:31,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:31:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:31:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:31,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-11-20 09:31:31,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 879 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 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-20 09:31:31,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:31,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-11-20 09:31:31,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:32,520 INFO L130 PetriNetUnfolder]: 1055/2194 cut-off events. [2022-11-20 09:31:32,521 INFO L131 PetriNetUnfolder]: For 20581/20941 co-relation queries the response was YES. [2022-11-20 09:31:32,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10880 conditions, 2194 events. 1055/2194 cut-off events. For 20581/20941 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15219 event pairs, 44 based on Foata normal form. 75/2241 useless extension candidates. Maximal degree in co-relation 10815. Up to 505 conditions per place. [2022-11-20 09:31:32,543 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 94 selfloop transitions, 34 changer transitions 70/279 dead transitions. [2022-11-20 09:31:32,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 279 transitions, 2541 flow [2022-11-20 09:31:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:31:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 09:31:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1554 transitions. [2022-11-20 09:31:32,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8445652173913043 [2022-11-20 09:31:32,548 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1554 transitions. [2022-11-20 09:31:32,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1554 transitions. [2022-11-20 09:31:32,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:32,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1554 transitions. [2022-11-20 09:31:32,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.125) internal successors, (1554), 16 states have internal predecessors, (1554), 0 states have call successors, (0), 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-20 09:31:32,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 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-20 09:31:32,557 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 115.0) internal successors, (1955), 17 states have internal predecessors, (1955), 0 states have call successors, (0), 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-20 09:31:32,557 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 879 flow. Second operand 16 states and 1554 transitions. [2022-11-20 09:31:32,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 279 transitions, 2541 flow [2022-11-20 09:31:32,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 279 transitions, 2303 flow, removed 94 selfloop flow, removed 10 redundant places. [2022-11-20 09:31:32,631 INFO L231 Difference]: Finished difference. Result has 172 places, 154 transitions, 834 flow [2022-11-20 09:31:32,631 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=834, PETRI_PLACES=172, PETRI_TRANSITIONS=154} [2022-11-20 09:31:32,632 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 52 predicate places. [2022-11-20 09:31:32,632 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 154 transitions, 834 flow [2022-11-20 09:31:32,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 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-20 09:31:32,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:32,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:32,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:31:32,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1679909184, now seen corresponding path program 1 times [2022-11-20 09:31:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:32,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424131361] [2022-11-20 09:31:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:32,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:33,158 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-20 09:31:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:33,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424131361] [2022-11-20 09:31:33,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424131361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:33,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:33,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:31:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713751114] [2022-11-20 09:31:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:33,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:31:33,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:33,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:31:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:33,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-20 09:31:33,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 154 transitions, 834 flow. Second operand has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 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-20 09:31:33,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:33,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-20 09:31:33,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:33,666 INFO L130 PetriNetUnfolder]: 343/1352 cut-off events. [2022-11-20 09:31:33,666 INFO L131 PetriNetUnfolder]: For 3747/3846 co-relation queries the response was YES. [2022-11-20 09:31:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4446 conditions, 1352 events. 343/1352 cut-off events. For 3747/3846 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12186 event pairs, 21 based on Foata normal form. 1/1267 useless extension candidates. Maximal degree in co-relation 4374. Up to 128 conditions per place. [2022-11-20 09:31:33,685 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 49 selfloop transitions, 1 changer transitions 38/189 dead transitions. [2022-11-20 09:31:33,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 189 transitions, 1311 flow [2022-11-20 09:31:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:31:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2022-11-20 09:31:33,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7677018633540372 [2022-11-20 09:31:33,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2022-11-20 09:31:33,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2022-11-20 09:31:33,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:33,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2022-11-20 09:31:33,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 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-20 09:31:33,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-20 09:31:33,696 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-20 09:31:33,696 INFO L175 Difference]: Start difference. First operand has 172 places, 154 transitions, 834 flow. Second operand 7 states and 618 transitions. [2022-11-20 09:31:33,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 189 transitions, 1311 flow [2022-11-20 09:31:33,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 189 transitions, 1096 flow, removed 85 selfloop flow, removed 17 redundant places. [2022-11-20 09:31:33,733 INFO L231 Difference]: Finished difference. Result has 163 places, 142 transitions, 635 flow [2022-11-20 09:31:33,733 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=635, PETRI_PLACES=163, PETRI_TRANSITIONS=142} [2022-11-20 09:31:33,738 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 43 predicate places. [2022-11-20 09:31:33,738 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 635 flow [2022-11-20 09:31:33,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 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-20 09:31:33,739 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:33,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:31:33,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1446772598, now seen corresponding path program 2 times [2022-11-20 09:31:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065983176] [2022-11-20 09:31:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:34,319 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-20 09:31:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:34,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065983176] [2022-11-20 09:31:34,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065983176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:34,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:34,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:31:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728381406] [2022-11-20 09:31:34,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:34,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:31:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:34,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:31:34,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:34,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-20 09:31:34,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 142 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 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-20 09:31:34,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:34,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-20 09:31:34,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:34,839 INFO L130 PetriNetUnfolder]: 346/1527 cut-off events. [2022-11-20 09:31:34,839 INFO L131 PetriNetUnfolder]: For 1908/1937 co-relation queries the response was YES. [2022-11-20 09:31:34,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 1527 events. 346/1527 cut-off events. For 1908/1937 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 14736 event pairs, 9 based on Foata normal form. 1/1422 useless extension candidates. Maximal degree in co-relation 4274. Up to 195 conditions per place. [2022-11-20 09:31:34,860 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 46 selfloop transitions, 2 changer transitions 25/174 dead transitions. [2022-11-20 09:31:34,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 174 transitions, 984 flow [2022-11-20 09:31:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:31:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 620 transitions. [2022-11-20 09:31:34,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7701863354037267 [2022-11-20 09:31:34,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 620 transitions. [2022-11-20 09:31:34,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 620 transitions. [2022-11-20 09:31:34,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:34,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 620 transitions. [2022-11-20 09:31:34,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 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-20 09:31:34,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-20 09:31:34,870 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-20 09:31:34,871 INFO L175 Difference]: Start difference. First operand has 163 places, 142 transitions, 635 flow. Second operand 7 states and 620 transitions. [2022-11-20 09:31:34,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 174 transitions, 984 flow [2022-11-20 09:31:34,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 174 transitions, 896 flow, removed 13 selfloop flow, removed 12 redundant places. [2022-11-20 09:31:34,909 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 574 flow [2022-11-20 09:31:34,909 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2022-11-20 09:31:34,910 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 38 predicate places. [2022-11-20 09:31:34,910 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 574 flow [2022-11-20 09:31:34,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 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-20 09:31:34,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:34,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:34,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:31:34,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash -742468878, now seen corresponding path program 3 times [2022-11-20 09:31:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:34,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811498637] [2022-11-20 09:31:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:36,835 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-20 09:31:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:36,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811498637] [2022-11-20 09:31:36,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811498637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:36,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 09:31:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382548842] [2022-11-20 09:31:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:36,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:31:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:31:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:31:36,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 115 [2022-11-20 09:31:36,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 574 flow. Second operand has 14 states, 14 states have (on average 86.78571428571429) internal successors, (1215), 14 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:36,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:31:36,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 115 [2022-11-20 09:31:36,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:31:37,421 INFO L130 PetriNetUnfolder]: 340/1643 cut-off events. [2022-11-20 09:31:37,421 INFO L131 PetriNetUnfolder]: For 2099/2160 co-relation queries the response was YES. [2022-11-20 09:31:37,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 1643 events. 340/1643 cut-off events. For 2099/2160 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 16696 event pairs, 5 based on Foata normal form. 12/1567 useless extension candidates. Maximal degree in co-relation 4417. Up to 182 conditions per place. [2022-11-20 09:31:37,434 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 27 selfloop transitions, 6 changer transitions 11/149 dead transitions. [2022-11-20 09:31:37,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 149 transitions, 726 flow [2022-11-20 09:31:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:31:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:31:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 974 transitions. [2022-11-20 09:31:37,437 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7699604743083004 [2022-11-20 09:31:37,437 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 974 transitions. [2022-11-20 09:31:37,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 974 transitions. [2022-11-20 09:31:37,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:31:37,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 974 transitions. [2022-11-20 09:31:37,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 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-20 09:31:37,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-20 09:31:37,442 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 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-20 09:31:37,443 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 574 flow. Second operand 11 states and 974 transitions. [2022-11-20 09:31:37,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 149 transitions, 726 flow [2022-11-20 09:31:37,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 699 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-11-20 09:31:37,480 INFO L231 Difference]: Finished difference. Result has 161 places, 135 transitions, 578 flow [2022-11-20 09:31:37,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=578, PETRI_PLACES=161, PETRI_TRANSITIONS=135} [2022-11-20 09:31:37,482 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 41 predicate places. [2022-11-20 09:31:37,482 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 135 transitions, 578 flow [2022-11-20 09:31:37,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.78571428571429) internal successors, (1215), 14 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:37,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:31:37,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:37,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:31:37,486 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:31:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1560340788, now seen corresponding path program 4 times [2022-11-20 09:31:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:37,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464307794] [2022-11-20 09:31:37,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:37,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:37,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:31:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:37,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:31:37,642 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:31:37,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 09:31:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 09:31:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 09:31:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 09:31:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 09:31:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 09:31:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:31:37,648 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:37,654 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:31:37,654 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:31:37,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:31:37 BasicIcfg [2022-11-20 09:31:37,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:31:37,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:31:37,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:31:37,816 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:31:37,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:18" (3/4) ... [2022-11-20 09:31:37,818 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 09:31:37,949 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:31:37,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:31:37,950 INFO L158 Benchmark]: Toolchain (without parser) took 20943.16ms. Allocated memory was 172.0MB in the beginning and 419.4MB in the end (delta: 247.5MB). Free memory was 139.7MB in the beginning and 219.2MB in the end (delta: -79.5MB). Peak memory consumption was 168.7MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,950 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 81.3MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:37,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.08ms. Allocated memory is still 172.0MB. Free memory was 139.4MB in the beginning and 115.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.20ms. Allocated memory is still 172.0MB. Free memory was 115.7MB in the beginning and 112.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,951 INFO L158 Benchmark]: Boogie Preprocessor took 60.37ms. Allocated memory is still 172.0MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,951 INFO L158 Benchmark]: RCFGBuilder took 919.79ms. Allocated memory is still 172.0MB. Free memory was 110.8MB in the beginning and 127.8MB in the end (delta: -17.0MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,952 INFO L158 Benchmark]: TraceAbstraction took 19000.96ms. Allocated memory was 172.0MB in the beginning and 419.4MB in the end (delta: 247.5MB). Free memory was 127.1MB in the beginning and 241.3MB in the end (delta: -114.2MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,952 INFO L158 Benchmark]: Witness Printer took 133.83ms. Allocated memory is still 419.4MB. Free memory was 241.3MB in the beginning and 219.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 09:31:37,955 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.27ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 81.3MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.08ms. Allocated memory is still 172.0MB. Free memory was 139.4MB in the beginning and 115.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.20ms. Allocated memory is still 172.0MB. Free memory was 115.7MB in the beginning and 112.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.37ms. Allocated memory is still 172.0MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 919.79ms. Allocated memory is still 172.0MB. Free memory was 110.8MB in the beginning and 127.8MB in the end (delta: -17.0MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19000.96ms. Allocated memory was 172.0MB in the beginning and 419.4MB in the end (delta: 247.5MB). Free memory was 127.1MB in the beginning and 241.3MB in the end (delta: -114.2MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 133.83ms. Allocated memory is still 419.4MB. Free memory was 241.3MB in the beginning and 219.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t1403; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t1404; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t1405; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 821]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 792 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 792 mSDsluCounter, 748 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 612 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1568 IncrementalHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 136 mSDtfsCounter, 1568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=6, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 877 NumberOfCodeBlocks, 877 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 5865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-20 09:31:37,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22e3ace1-96ca-44b1-a1a0-b0152e757ae1/bin/uautomizer-ug76WZFUDN/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