./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro --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 f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- 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-8393723 [2022-11-18 20:22:58,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:22:58,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:22:58,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:22:58,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:22:58,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:22:58,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:22:58,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:22:58,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:22:58,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:22:58,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:22:58,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:22:58,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:22:58,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:22:58,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:22:58,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:22:58,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:22:58,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:22:58,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:22:58,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:22:58,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:22:58,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:22:58,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:22:58,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:22:58,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:22:58,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:22:58,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:22:58,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:22:58,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:22:58,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:22:58,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:22:58,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:22:58,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:22:58,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:22:58,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:22:58,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:22:58,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:22:58,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:22:58,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:22:58,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:22:58,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:22:58,277 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:22:58,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:22:58,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:22:58,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:22:58,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:22:58,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:22:58,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:22:58,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:22:58,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:22:58,311 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:22:58,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:22:58,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:22:58,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:22:58,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:22:58,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:22:58,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:22:58,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:22:58,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:22:58,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:22:58,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:22:58,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:22:58,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:22:58,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:22:58,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:22:58,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:22:58,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:22:58,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:22:58,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:22:58,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:22:58,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:22:58,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:22:58,318 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:22:58,318 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:22:58,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:22:58,319 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_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/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_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2022-11-18 20:22:58,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:22:58,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:22:58,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:22:58,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:22:58,680 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:22:58,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-11-18 20:22:58,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/data/927084f26/6f0f352e27bf4d49800d069a84931221/FLAGbe177128b [2022-11-18 20:22:59,529 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:22:59,530 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-11-18 20:22:59,548 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/data/927084f26/6f0f352e27bf4d49800d069a84931221/FLAGbe177128b [2022-11-18 20:22:59,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/data/927084f26/6f0f352e27bf4d49800d069a84931221 [2022-11-18 20:22:59,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:22:59,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:22:59,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:22:59,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:22:59,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:22:59,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:22:59" (1/1) ... [2022-11-18 20:22:59,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46998ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:22:59, skipping insertion in model container [2022-11-18 20:22:59,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:22:59" (1/1) ... [2022-11-18 20:22:59,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:22:59,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:23:00,114 WARN L234 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_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2022-11-18 20:23:00,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:23:00,451 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:23:00,477 WARN L234 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_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2022-11-18 20:23:00,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:23:00,647 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:23:00,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00 WrapperNode [2022-11-18 20:23:00,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:23:00,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:23:00,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:23:00,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:23:00,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,746 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-18 20:23:00,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:23:00,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:23:00,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:23:00,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:23:00,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,812 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:23:00,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:23:00,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:23:00,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:23:00,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (1/1) ... [2022-11-18 20:23:00,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:23:00,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:23:00,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:23:00,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:23:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:23:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:23:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:23:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:23:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:23:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:23:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:23:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:23:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:23:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:23:00,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:23:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:23:00,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:23:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:23:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:23:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:23:00,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:23:00,961 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:23:01,243 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:23:01,246 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:23:01,816 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:23:02,126 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:23:02,127 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:23:02,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:23:02 BoogieIcfgContainer [2022-11-18 20:23:02,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:23:02,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:23:02,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:23:02,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:23:02,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:22:59" (1/3) ... [2022-11-18 20:23:02,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f2809a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:23:02, skipping insertion in model container [2022-11-18 20:23:02,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:23:00" (2/3) ... [2022-11-18 20:23:02,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f2809a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:23:02, skipping insertion in model container [2022-11-18 20:23:02,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:23:02" (3/3) ... [2022-11-18 20:23:02,158 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-11-18 20:23:02,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:23:02,182 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:23:02,183 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:23:02,183 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:23:02,257 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:23:02,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 20:23:02,424 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-18 20:23:02,425 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:23:02,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-18 20:23:02,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 20:23:02,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-18 20:23:02,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:23:02,492 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;@4e64b046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:23:02,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 20:23:02,543 INFO L130 PetriNetUnfolder]: 0/90 cut-off events. [2022-11-18 20:23:02,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:23:02,544 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:02,545 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] [2022-11-18 20:23:02,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1064667452, now seen corresponding path program 1 times [2022-11-18 20:23:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148081831] [2022-11-18 20:23:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:03,536 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-18 20:23:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:03,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148081831] [2022-11-18 20:23:03,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148081831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:03,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:03,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:23:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206410807] [2022-11-18 20:23:03,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:23:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:23:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:23:03,592 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-11-18 20:23:03,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:03,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:03,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-11-18 20:23:03,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:03,850 INFO L130 PetriNetUnfolder]: 17/277 cut-off events. [2022-11-18 20:23:03,851 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 20:23:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 17/277 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 828 event pairs, 7 based on Foata normal form. 9/275 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2022-11-18 20:23:03,858 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-11-18 20:23:03,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 132 transitions, 302 flow [2022-11-18 20:23:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:23:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:23:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-18 20:23:03,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2022-11-18 20:23:03,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-18 20:23:03,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-18 20:23:03,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:03,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-18 20:23:03,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-18 20:23:03,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-18 20:23:03,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-18 20:23:03,925 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2022-11-18 20:23:03,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 132 transitions, 302 flow [2022-11-18 20:23:03,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:23:03,938 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-18 20:23:03,942 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-18 20:23:03,949 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-18 20:23:03,949 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-18 20:23:03,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:03,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:03,951 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] [2022-11-18 20:23:03,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:23:03,951 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash 374088770, now seen corresponding path program 1 times [2022-11-18 20:23:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:03,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634903956] [2022-11-18 20:23:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:05,164 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-18 20:23:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634903956] [2022-11-18 20:23:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634903956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:05,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:05,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:23:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314319364] [2022-11-18 20:23:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:05,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:23:05,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:05,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:23:05,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:23:05,170 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-18 20:23:05,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:05,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:05,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-18 20:23:05,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:07,756 INFO L130 PetriNetUnfolder]: 2580/6381 cut-off events. [2022-11-18 20:23:07,757 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-11-18 20:23:07,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10317 conditions, 6381 events. 2580/6381 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 57245 event pairs, 338 based on Foata normal form. 0/6246 useless extension candidates. Maximal degree in co-relation 10250. Up to 1458 conditions per place. [2022-11-18 20:23:07,816 INFO L137 encePairwiseOnDemand]: 124/137 looper letters, 39 selfloop transitions, 9 changer transitions 89/221 dead transitions. [2022-11-18 20:23:07,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 221 transitions, 708 flow [2022-11-18 20:23:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:23:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:23:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1440 transitions. [2022-11-18 20:23:07,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8085345311622684 [2022-11-18 20:23:07,822 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1440 transitions. [2022-11-18 20:23:07,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1440 transitions. [2022-11-18 20:23:07,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:07,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1440 transitions. [2022-11-18 20:23:07,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.76923076923077) internal successors, (1440), 13 states have internal predecessors, (1440), 0 states have call successors, (0), 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-18 20:23:07,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:07,837 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:07,837 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1440 transitions. [2022-11-18 20:23:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 221 transitions, 708 flow [2022-11-18 20:23:07,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 221 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:23:07,846 INFO L231 Difference]: Finished difference. Result has 162 places, 122 transitions, 360 flow [2022-11-18 20:23:07,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=360, PETRI_PLACES=162, PETRI_TRANSITIONS=122} [2022-11-18 20:23:07,848 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-11-18 20:23:07,849 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 122 transitions, 360 flow [2022-11-18 20:23:07,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:07,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:07,851 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, 1] [2022-11-18 20:23:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:23:07,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1219916353, now seen corresponding path program 1 times [2022-11-18 20:23:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:07,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988120863] [2022-11-18 20:23:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:08,775 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-18 20:23:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988120863] [2022-11-18 20:23:08,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988120863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:08,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:08,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:23:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434938074] [2022-11-18 20:23:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:08,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:23:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:23:08,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:23:08,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-18 20:23:08,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 122 transitions, 360 flow. Second operand has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 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-18 20:23:08,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:08,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-18 20:23:08,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:10,606 INFO L130 PetriNetUnfolder]: 1694/3640 cut-off events. [2022-11-18 20:23:10,606 INFO L131 PetriNetUnfolder]: For 9022/10429 co-relation queries the response was YES. [2022-11-18 20:23:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12652 conditions, 3640 events. 1694/3640 cut-off events. For 9022/10429 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26906 event pairs, 280 based on Foata normal form. 73/3619 useless extension candidates. Maximal degree in co-relation 12573. Up to 1465 conditions per place. [2022-11-18 20:23:10,661 INFO L137 encePairwiseOnDemand]: 122/137 looper letters, 43 selfloop transitions, 19 changer transitions 64/210 dead transitions. [2022-11-18 20:23:10,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 210 transitions, 1234 flow [2022-11-18 20:23:10,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:23:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:23:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1436 transitions. [2022-11-18 20:23:10,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8062886019090398 [2022-11-18 20:23:10,668 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1436 transitions. [2022-11-18 20:23:10,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1436 transitions. [2022-11-18 20:23:10,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:10,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1436 transitions. [2022-11-18 20:23:10,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 0 states have call successors, (0), 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-18 20:23:10,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:10,683 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:10,684 INFO L175 Difference]: Start difference. First operand has 162 places, 122 transitions, 360 flow. Second operand 13 states and 1436 transitions. [2022-11-18 20:23:10,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 210 transitions, 1234 flow [2022-11-18 20:23:10,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 210 transitions, 1182 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-18 20:23:10,736 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 505 flow [2022-11-18 20:23:10,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=505, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2022-11-18 20:23:10,738 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 14 predicate places. [2022-11-18 20:23:10,738 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 505 flow [2022-11-18 20:23:10,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 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-18 20:23:10,739 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:10,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, 1, 1, 1] [2022-11-18 20:23:10,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:23:10,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1524003752, now seen corresponding path program 1 times [2022-11-18 20:23:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:10,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520387456] [2022-11-18 20:23:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:12,380 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-18 20:23:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520387456] [2022-11-18 20:23:12,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520387456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:12,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:12,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:23:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118066345] [2022-11-18 20:23:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:12,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:23:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:12,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:23:12,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:23:12,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-18 20:23:12,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 505 flow. Second operand has 12 states, 12 states have (on average 112.5) internal successors, (1350), 12 states have internal predecessors, (1350), 0 states have call successors, (0), 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-18 20:23:12,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:12,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-18 20:23:12,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:13,545 INFO L130 PetriNetUnfolder]: 1003/2361 cut-off events. [2022-11-18 20:23:13,546 INFO L131 PetriNetUnfolder]: For 8804/10868 co-relation queries the response was YES. [2022-11-18 20:23:13,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9148 conditions, 2361 events. 1003/2361 cut-off events. For 8804/10868 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17522 event pairs, 404 based on Foata normal form. 117/2360 useless extension candidates. Maximal degree in co-relation 9063. Up to 1048 conditions per place. [2022-11-18 20:23:13,591 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 30 selfloop transitions, 13 changer transitions 31/178 dead transitions. [2022-11-18 20:23:13,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 178 transitions, 1003 flow [2022-11-18 20:23:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:23:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-18 20:23:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1608 transitions. [2022-11-18 20:23:13,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8383733055265902 [2022-11-18 20:23:13,599 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1608 transitions. [2022-11-18 20:23:13,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1608 transitions. [2022-11-18 20:23:13,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:13,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1608 transitions. [2022-11-18 20:23:13,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.85714285714286) internal successors, (1608), 14 states have internal predecessors, (1608), 0 states have call successors, (0), 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-18 20:23:13,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-18 20:23:13,614 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-18 20:23:13,614 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 505 flow. Second operand 14 states and 1608 transitions. [2022-11-18 20:23:13,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 178 transitions, 1003 flow [2022-11-18 20:23:13,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 178 transitions, 949 flow, removed 27 selfloop flow, removed 12 redundant places. [2022-11-18 20:23:13,683 INFO L231 Difference]: Finished difference. Result has 157 places, 137 transitions, 570 flow [2022-11-18 20:23:13,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=570, PETRI_PLACES=157, PETRI_TRANSITIONS=137} [2022-11-18 20:23:13,685 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2022-11-18 20:23:13,685 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 137 transitions, 570 flow [2022-11-18 20:23:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.5) internal successors, (1350), 12 states have internal predecessors, (1350), 0 states have call successors, (0), 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-18 20:23:13,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:13,687 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, 1, 1, 1, 1] [2022-11-18 20:23:13,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:23:13,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1726935266, now seen corresponding path program 1 times [2022-11-18 20:23:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:13,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246636908] [2022-11-18 20:23:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:15,335 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-18 20:23:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:15,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246636908] [2022-11-18 20:23:15,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246636908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:15,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:15,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:23:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434636506] [2022-11-18 20:23:15,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:15,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:23:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:23:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:23:15,341 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-18 20:23:15,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 137 transitions, 570 flow. Second operand has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 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-18 20:23:15,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:15,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-18 20:23:15,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:17,527 INFO L130 PetriNetUnfolder]: 1400/3139 cut-off events. [2022-11-18 20:23:17,528 INFO L131 PetriNetUnfolder]: For 13269/17946 co-relation queries the response was YES. [2022-11-18 20:23:17,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13722 conditions, 3139 events. 1400/3139 cut-off events. For 13269/17946 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22910 event pairs, 138 based on Foata normal form. 49/3095 useless extension candidates. Maximal degree in co-relation 13631. Up to 1336 conditions per place. [2022-11-18 20:23:17,587 INFO L137 encePairwiseOnDemand]: 121/137 looper letters, 66 selfloop transitions, 56 changer transitions 64/270 dead transitions. [2022-11-18 20:23:17,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 270 transitions, 2234 flow [2022-11-18 20:23:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:23:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:23:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1752 transitions. [2022-11-18 20:23:17,592 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7992700729927007 [2022-11-18 20:23:17,593 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1752 transitions. [2022-11-18 20:23:17,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1752 transitions. [2022-11-18 20:23:17,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:17,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1752 transitions. [2022-11-18 20:23:17,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 109.5) internal successors, (1752), 16 states have internal predecessors, (1752), 0 states have call successors, (0), 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-18 20:23:17,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-18 20:23:17,606 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-18 20:23:17,607 INFO L175 Difference]: Start difference. First operand has 157 places, 137 transitions, 570 flow. Second operand 16 states and 1752 transitions. [2022-11-18 20:23:17,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 270 transitions, 2234 flow [2022-11-18 20:23:17,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 270 transitions, 2192 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-11-18 20:23:17,642 INFO L231 Difference]: Finished difference. Result has 174 places, 182 transitions, 1280 flow [2022-11-18 20:23:17,642 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1280, PETRI_PLACES=174, PETRI_TRANSITIONS=182} [2022-11-18 20:23:17,643 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 30 predicate places. [2022-11-18 20:23:17,644 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 182 transitions, 1280 flow [2022-11-18 20:23:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 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-18 20:23:17,645 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:17,645 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, 1, 1, 1, 1] [2022-11-18 20:23:17,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:23:17,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1019461794, now seen corresponding path program 2 times [2022-11-18 20:23:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:17,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66644646] [2022-11-18 20:23:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:19,168 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-18 20:23:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66644646] [2022-11-18 20:23:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66644646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:19,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:19,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:23:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752249410] [2022-11-18 20:23:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:19,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:23:19,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:23:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:23:19,174 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-18 20:23:19,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 182 transitions, 1280 flow. Second operand has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 0 states have call successors, (0), 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-18 20:23:19,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:19,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-18 20:23:19,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:21,715 INFO L130 PetriNetUnfolder]: 1646/3580 cut-off events. [2022-11-18 20:23:21,718 INFO L131 PetriNetUnfolder]: For 30415/53296 co-relation queries the response was YES. [2022-11-18 20:23:21,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20259 conditions, 3580 events. 1646/3580 cut-off events. For 30415/53296 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26506 event pairs, 151 based on Foata normal form. 187/3663 useless extension candidates. Maximal degree in co-relation 20156. Up to 1618 conditions per place. [2022-11-18 20:23:21,800 INFO L137 encePairwiseOnDemand]: 119/137 looper letters, 86 selfloop transitions, 82 changer transitions 96/348 dead transitions. [2022-11-18 20:23:21,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 348 transitions, 4024 flow [2022-11-18 20:23:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:23:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 20:23:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2058 transitions. [2022-11-18 20:23:21,809 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7906262005378409 [2022-11-18 20:23:21,809 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2058 transitions. [2022-11-18 20:23:21,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2058 transitions. [2022-11-18 20:23:21,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:21,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2058 transitions. [2022-11-18 20:23:21,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 108.3157894736842) internal successors, (2058), 19 states have internal predecessors, (2058), 0 states have call successors, (0), 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-18 20:23:21,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-18 20:23:21,825 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-18 20:23:21,825 INFO L175 Difference]: Start difference. First operand has 174 places, 182 transitions, 1280 flow. Second operand 19 states and 2058 transitions. [2022-11-18 20:23:21,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 348 transitions, 4024 flow [2022-11-18 20:23:21,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 348 transitions, 3921 flow, removed 51 selfloop flow, removed 10 redundant places. [2022-11-18 20:23:21,914 INFO L231 Difference]: Finished difference. Result has 187 places, 226 transitions, 2282 flow [2022-11-18 20:23:21,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2282, PETRI_PLACES=187, PETRI_TRANSITIONS=226} [2022-11-18 20:23:21,916 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 43 predicate places. [2022-11-18 20:23:21,916 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 226 transitions, 2282 flow [2022-11-18 20:23:21,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 0 states have call successors, (0), 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-18 20:23:21,917 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:21,918 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, 1, 1, 1, 1] [2022-11-18 20:23:21,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:23:21,918 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:21,919 INFO L85 PathProgramCache]: Analyzing trace with hash 633070274, now seen corresponding path program 3 times [2022-11-18 20:23:21,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:21,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974077434] [2022-11-18 20:23:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:23,004 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-18 20:23:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:23,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974077434] [2022-11-18 20:23:23,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974077434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:23,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:23,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:23:23,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609662572] [2022-11-18 20:23:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:23,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:23:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:23:23,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:23:23,019 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 20:23:23,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 226 transitions, 2282 flow. Second operand has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 0 states have call successors, (0), 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-18 20:23:23,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:23,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 20:23:23,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:24,261 INFO L130 PetriNetUnfolder]: 1276/2785 cut-off events. [2022-11-18 20:23:24,262 INFO L131 PetriNetUnfolder]: For 38566/61206 co-relation queries the response was YES. [2022-11-18 20:23:24,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18759 conditions, 2785 events. 1276/2785 cut-off events. For 38566/61206 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20476 event pairs, 136 based on Foata normal form. 400/3090 useless extension candidates. Maximal degree in co-relation 18650. Up to 1350 conditions per place. [2022-11-18 20:23:24,336 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 59 selfloop transitions, 42 changer transitions 16/266 dead transitions. [2022-11-18 20:23:24,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 266 transitions, 3044 flow [2022-11-18 20:23:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:23:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:23:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1280 transitions. [2022-11-18 20:23:24,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8493696084936961 [2022-11-18 20:23:24,341 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1280 transitions. [2022-11-18 20:23:24,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1280 transitions. [2022-11-18 20:23:24,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:24,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1280 transitions. [2022-11-18 20:23:24,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.36363636363636) internal successors, (1280), 11 states have internal predecessors, (1280), 0 states have call successors, (0), 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-18 20:23:24,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 20:23:24,350 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 20:23:24,350 INFO L175 Difference]: Start difference. First operand has 187 places, 226 transitions, 2282 flow. Second operand 11 states and 1280 transitions. [2022-11-18 20:23:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 266 transitions, 3044 flow [2022-11-18 20:23:24,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 266 transitions, 2932 flow, removed 50 selfloop flow, removed 7 redundant places. [2022-11-18 20:23:24,459 INFO L231 Difference]: Finished difference. Result has 187 places, 239 transitions, 2480 flow [2022-11-18 20:23:24,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2480, PETRI_PLACES=187, PETRI_TRANSITIONS=239} [2022-11-18 20:23:24,460 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 43 predicate places. [2022-11-18 20:23:24,460 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 239 transitions, 2480 flow [2022-11-18 20:23:24,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 0 states have call successors, (0), 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-18 20:23:24,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:24,462 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, 1, 1, 1, 1] [2022-11-18 20:23:24,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:23:24,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash -747252282, now seen corresponding path program 4 times [2022-11-18 20:23:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958769583] [2022-11-18 20:23:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:25,453 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-18 20:23:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:25,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958769583] [2022-11-18 20:23:25,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958769583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:25,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:25,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:23:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251044682] [2022-11-18 20:23:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:25,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:23:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:23:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:23:25,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-18 20:23:25,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 239 transitions, 2480 flow. Second operand has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 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-18 20:23:25,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:25,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-18 20:23:25,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:27,551 INFO L130 PetriNetUnfolder]: 1668/3638 cut-off events. [2022-11-18 20:23:27,552 INFO L131 PetriNetUnfolder]: For 53238/90175 co-relation queries the response was YES. [2022-11-18 20:23:27,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25280 conditions, 3638 events. 1668/3638 cut-off events. For 53238/90175 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 27140 event pairs, 115 based on Foata normal form. 204/3741 useless extension candidates. Maximal degree in co-relation 25162. Up to 1621 conditions per place. [2022-11-18 20:23:27,644 INFO L137 encePairwiseOnDemand]: 120/137 looper letters, 89 selfloop transitions, 109 changer transitions 49/331 dead transitions. [2022-11-18 20:23:27,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 331 transitions, 4475 flow [2022-11-18 20:23:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:23:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-18 20:23:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1524 transitions. [2022-11-18 20:23:27,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.794577685088634 [2022-11-18 20:23:27,649 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1524 transitions. [2022-11-18 20:23:27,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1524 transitions. [2022-11-18 20:23:27,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:27,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1524 transitions. [2022-11-18 20:23:27,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 108.85714285714286) internal successors, (1524), 14 states have internal predecessors, (1524), 0 states have call successors, (0), 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-18 20:23:27,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-18 20:23:27,661 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-18 20:23:27,661 INFO L175 Difference]: Start difference. First operand has 187 places, 239 transitions, 2480 flow. Second operand 14 states and 1524 transitions. [2022-11-18 20:23:27,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 331 transitions, 4475 flow [2022-11-18 20:23:27,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 331 transitions, 4440 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-11-18 20:23:27,825 INFO L231 Difference]: Finished difference. Result has 198 places, 260 transitions, 3282 flow [2022-11-18 20:23:27,826 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3282, PETRI_PLACES=198, PETRI_TRANSITIONS=260} [2022-11-18 20:23:27,827 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 54 predicate places. [2022-11-18 20:23:27,827 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 260 transitions, 3282 flow [2022-11-18 20:23:27,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 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-18 20:23:27,828 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:27,828 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, 1, 1, 1, 1] [2022-11-18 20:23:27,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:23:27,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash -160985790, now seen corresponding path program 5 times [2022-11-18 20:23:27,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:27,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51651992] [2022-11-18 20:23:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:27,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:28,747 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-18 20:23:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:28,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51651992] [2022-11-18 20:23:28,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51651992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:28,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:28,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:23:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679790411] [2022-11-18 20:23:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:28,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:23:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:23:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:23:28,753 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-18 20:23:28,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 260 transitions, 3282 flow. Second operand has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 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-18 20:23:28,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:28,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-18 20:23:28,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:29,996 INFO L130 PetriNetUnfolder]: 1197/2748 cut-off events. [2022-11-18 20:23:29,996 INFO L131 PetriNetUnfolder]: For 57825/97265 co-relation queries the response was YES. [2022-11-18 20:23:30,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21902 conditions, 2748 events. 1197/2748 cut-off events. For 57825/97265 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20870 event pairs, 122 based on Foata normal form. 462/3122 useless extension candidates. Maximal degree in co-relation 21784. Up to 1279 conditions per place. [2022-11-18 20:23:30,065 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 68 selfloop transitions, 41 changer transitions 31/302 dead transitions. [2022-11-18 20:23:30,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 302 transitions, 4458 flow [2022-11-18 20:23:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:23:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:23:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1495 transitions. [2022-11-18 20:23:30,071 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8394160583941606 [2022-11-18 20:23:30,071 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1495 transitions. [2022-11-18 20:23:30,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1495 transitions. [2022-11-18 20:23:30,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:30,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1495 transitions. [2022-11-18 20:23:30,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 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-18 20:23:30,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:30,082 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:30,082 INFO L175 Difference]: Start difference. First operand has 198 places, 260 transitions, 3282 flow. Second operand 13 states and 1495 transitions. [2022-11-18 20:23:30,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 302 transitions, 4458 flow [2022-11-18 20:23:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 302 transitions, 4209 flow, removed 113 selfloop flow, removed 6 redundant places. [2022-11-18 20:23:30,258 INFO L231 Difference]: Finished difference. Result has 205 places, 266 transitions, 3444 flow [2022-11-18 20:23:30,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=3145, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3444, PETRI_PLACES=205, PETRI_TRANSITIONS=266} [2022-11-18 20:23:30,261 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 61 predicate places. [2022-11-18 20:23:30,261 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 266 transitions, 3444 flow [2022-11-18 20:23:30,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.72727272727273) internal successors, (1240), 11 states have internal predecessors, (1240), 0 states have call successors, (0), 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-18 20:23:30,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:30,263 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, 1, 1, 1, 1, 1] [2022-11-18 20:23:30,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:23:30,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 214605117, now seen corresponding path program 1 times [2022-11-18 20:23:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:30,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758583989] [2022-11-18 20:23:30,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:31,389 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-18 20:23:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:31,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758583989] [2022-11-18 20:23:31,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758583989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:31,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:31,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:23:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963241475] [2022-11-18 20:23:31,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:31,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:23:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:23:31,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:23:31,393 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 20:23:31,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 266 transitions, 3444 flow. Second operand has 11 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 0 states have call successors, (0), 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-18 20:23:31,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:31,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 20:23:31,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:32,638 INFO L130 PetriNetUnfolder]: 1132/2864 cut-off events. [2022-11-18 20:23:32,639 INFO L131 PetriNetUnfolder]: For 49682/88391 co-relation queries the response was YES. [2022-11-18 20:23:32,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21231 conditions, 2864 events. 1132/2864 cut-off events. For 49682/88391 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23274 event pairs, 130 based on Foata normal form. 339/3112 useless extension candidates. Maximal degree in co-relation 21108. Up to 1194 conditions per place. [2022-11-18 20:23:32,701 INFO L137 encePairwiseOnDemand]: 128/137 looper letters, 81 selfloop transitions, 32 changer transitions 14/290 dead transitions. [2022-11-18 20:23:32,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 290 transitions, 4162 flow [2022-11-18 20:23:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:23:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 20:23:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1386 transitions. [2022-11-18 20:23:32,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.843065693430657 [2022-11-18 20:23:32,705 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1386 transitions. [2022-11-18 20:23:32,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1386 transitions. [2022-11-18 20:23:32,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:32,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1386 transitions. [2022-11-18 20:23:32,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 115.5) internal successors, (1386), 12 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:32,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-18 20:23:32,715 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-18 20:23:32,715 INFO L175 Difference]: Start difference. First operand has 205 places, 266 transitions, 3444 flow. Second operand 12 states and 1386 transitions. [2022-11-18 20:23:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 290 transitions, 4162 flow [2022-11-18 20:23:32,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 290 transitions, 4103 flow, removed 20 selfloop flow, removed 10 redundant places. [2022-11-18 20:23:32,894 INFO L231 Difference]: Finished difference. Result has 207 places, 268 transitions, 3595 flow [2022-11-18 20:23:32,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=3399, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3595, PETRI_PLACES=207, PETRI_TRANSITIONS=268} [2022-11-18 20:23:32,896 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2022-11-18 20:23:32,896 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 268 transitions, 3595 flow [2022-11-18 20:23:32,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 0 states have call successors, (0), 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-18 20:23:32,897 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:32,898 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, 1, 1, 1, 1, 1] [2022-11-18 20:23:32,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:23:32,898 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -431836163, now seen corresponding path program 1 times [2022-11-18 20:23:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876805651] [2022-11-18 20:23:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:33,162 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-18 20:23:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:33,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876805651] [2022-11-18 20:23:33,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876805651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:33,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:33,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:23:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412959859] [2022-11-18 20:23:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:23:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:23:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:23:33,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 20:23:33,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 268 transitions, 3595 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-18 20:23:33,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:33,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 20:23:33,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:39,584 INFO L130 PetriNetUnfolder]: 12144/21708 cut-off events. [2022-11-18 20:23:39,585 INFO L131 PetriNetUnfolder]: For 647917/689314 co-relation queries the response was YES. [2022-11-18 20:23:39,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124898 conditions, 21708 events. 12144/21708 cut-off events. For 647917/689314 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 200677 event pairs, 466 based on Foata normal form. 3521/23692 useless extension candidates. Maximal degree in co-relation 124779. Up to 7495 conditions per place. [2022-11-18 20:23:39,932 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 238 selfloop transitions, 20 changer transitions 74/495 dead transitions. [2022-11-18 20:23:39,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 495 transitions, 9225 flow [2022-11-18 20:23:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:23:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:23:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1204 transitions. [2022-11-18 20:23:39,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8788321167883212 [2022-11-18 20:23:39,936 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1204 transitions. [2022-11-18 20:23:39,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1204 transitions. [2022-11-18 20:23:39,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:39,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1204 transitions. [2022-11-18 20:23:39,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 0 states have call successors, (0), 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-18 20:23:39,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 20:23:39,944 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 20:23:39,944 INFO L175 Difference]: Start difference. First operand has 207 places, 268 transitions, 3595 flow. Second operand 10 states and 1204 transitions. [2022-11-18 20:23:39,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 495 transitions, 9225 flow [2022-11-18 20:23:41,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 495 transitions, 8899 flow, removed 71 selfloop flow, removed 10 redundant places. [2022-11-18 20:23:41,051 INFO L231 Difference]: Finished difference. Result has 206 places, 275 transitions, 3450 flow [2022-11-18 20:23:41,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3450, PETRI_PLACES=206, PETRI_TRANSITIONS=275} [2022-11-18 20:23:41,052 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 62 predicate places. [2022-11-18 20:23:41,053 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 275 transitions, 3450 flow [2022-11-18 20:23:41,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-18 20:23:41,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:23:41,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:23:41,054 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash 633404731, now seen corresponding path program 1 times [2022-11-18 20:23:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:41,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842382870] [2022-11-18 20:23:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:41,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:41,428 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-18 20:23:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:41,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842382870] [2022-11-18 20:23:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842382870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:41,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:23:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700562703] [2022-11-18 20:23:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:23:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:23:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:23:41,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 20:23:41,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 275 transitions, 3450 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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-18 20:23:41,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:41,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 20:23:41,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:48,081 INFO L130 PetriNetUnfolder]: 11196/21104 cut-off events. [2022-11-18 20:23:48,081 INFO L131 PetriNetUnfolder]: For 604982/647877 co-relation queries the response was YES. [2022-11-18 20:23:48,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132136 conditions, 21104 events. 11196/21104 cut-off events. For 604982/647877 co-relation queries the response was YES. Maximal size of possible extension queue 1801. Compared 207307 event pairs, 231 based on Foata normal form. 4319/24430 useless extension candidates. Maximal degree in co-relation 132017. Up to 6323 conditions per place. [2022-11-18 20:23:48,380 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 331 selfloop transitions, 38 changer transitions 63/585 dead transitions. [2022-11-18 20:23:48,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 585 transitions, 11122 flow [2022-11-18 20:23:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:23:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:23:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1568 transitions. [2022-11-18 20:23:48,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8804042672655812 [2022-11-18 20:23:48,386 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1568 transitions. [2022-11-18 20:23:48,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1568 transitions. [2022-11-18 20:23:48,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:48,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1568 transitions. [2022-11-18 20:23:48,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.61538461538461) internal successors, (1568), 13 states have internal predecessors, (1568), 0 states have call successors, (0), 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-18 20:23:48,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:48,395 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:23:48,395 INFO L175 Difference]: Start difference. First operand has 206 places, 275 transitions, 3450 flow. Second operand 13 states and 1568 transitions. [2022-11-18 20:23:48,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 585 transitions, 11122 flow [2022-11-18 20:23:50,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 585 transitions, 10804 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-11-18 20:23:50,017 INFO L231 Difference]: Finished difference. Result has 218 places, 274 transitions, 3195 flow [2022-11-18 20:23:50,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=2942, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3195, PETRI_PLACES=218, PETRI_TRANSITIONS=274} [2022-11-18 20:23:50,018 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 74 predicate places. [2022-11-18 20:23:50,018 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 274 transitions, 3195 flow [2022-11-18 20:23:50,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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-18 20:23:50,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:50,019 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:50,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:23:50,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1606191052, now seen corresponding path program 1 times [2022-11-18 20:23:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:50,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334978463] [2022-11-18 20:23:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:50,434 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-18 20:23:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:50,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334978463] [2022-11-18 20:23:50,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334978463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:50,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:50,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:23:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649899986] [2022-11-18 20:23:50,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:50,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:23:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:50,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:23:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:23:50,439 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-11-18 20:23:50,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 274 transitions, 3195 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 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-18 20:23:50,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:50,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-11-18 20:23:50,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:23:53,495 INFO L130 PetriNetUnfolder]: 3158/10743 cut-off events. [2022-11-18 20:23:53,495 INFO L131 PetriNetUnfolder]: For 82433/99306 co-relation queries the response was YES. [2022-11-18 20:23:53,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49123 conditions, 10743 events. 3158/10743 cut-off events. For 82433/99306 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 136479 event pairs, 293 based on Foata normal form. 455/10418 useless extension candidates. Maximal degree in co-relation 49003. Up to 3103 conditions per place. [2022-11-18 20:23:53,746 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 103 selfloop transitions, 28 changer transitions 27/329 dead transitions. [2022-11-18 20:23:53,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 329 transitions, 4505 flow [2022-11-18 20:23:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:23:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:23:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1084 transitions. [2022-11-18 20:23:53,749 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8791565287915653 [2022-11-18 20:23:53,749 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1084 transitions. [2022-11-18 20:23:53,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1084 transitions. [2022-11-18 20:23:53,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:23:53,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1084 transitions. [2022-11-18 20:23:53,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.44444444444444) internal successors, (1084), 9 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:53,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 20:23:53,756 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 20:23:53,757 INFO L175 Difference]: Start difference. First operand has 218 places, 274 transitions, 3195 flow. Second operand 9 states and 1084 transitions. [2022-11-18 20:23:53,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 329 transitions, 4505 flow [2022-11-18 20:23:55,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 329 transitions, 4327 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-11-18 20:23:55,507 INFO L231 Difference]: Finished difference. Result has 228 places, 270 transitions, 3032 flow [2022-11-18 20:23:55,508 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=3032, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3032, PETRI_PLACES=228, PETRI_TRANSITIONS=270} [2022-11-18 20:23:55,509 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 84 predicate places. [2022-11-18 20:23:55,509 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 270 transitions, 3032 flow [2022-11-18 20:23:55,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 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-18 20:23:55,510 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:23:55,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:55,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:23:55,510 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:23:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1945420882, now seen corresponding path program 1 times [2022-11-18 20:23:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257839612] [2022-11-18 20:23:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:55,847 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-18 20:23:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:23:55,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257839612] [2022-11-18 20:23:55,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257839612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:55,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:55,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:23:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241228562] [2022-11-18 20:23:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:23:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:23:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:23:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:23:55,851 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 20:23:55,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 270 transitions, 3032 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:55,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:23:55,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 20:23:55,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:24:04,265 INFO L130 PetriNetUnfolder]: 14513/28207 cut-off events. [2022-11-18 20:24:04,265 INFO L131 PetriNetUnfolder]: For 750270/797165 co-relation queries the response was YES. [2022-11-18 20:24:04,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179554 conditions, 28207 events. 14513/28207 cut-off events. For 750270/797165 co-relation queries the response was YES. Maximal size of possible extension queue 2419. Compared 297426 event pairs, 191 based on Foata normal form. 5570/32648 useless extension candidates. Maximal degree in co-relation 179429. Up to 5646 conditions per place. [2022-11-18 20:24:05,037 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 178 selfloop transitions, 56 changer transitions 209/578 dead transitions. [2022-11-18 20:24:05,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 578 transitions, 10551 flow [2022-11-18 20:24:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:24:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:24:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1931 transitions. [2022-11-18 20:24:05,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8809306569343066 [2022-11-18 20:24:05,067 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1931 transitions. [2022-11-18 20:24:05,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1931 transitions. [2022-11-18 20:24:05,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:24:05,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1931 transitions. [2022-11-18 20:24:05,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.6875) internal successors, (1931), 16 states have internal predecessors, (1931), 0 states have call successors, (0), 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-18 20:24:05,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-18 20:24:05,085 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-18 20:24:05,086 INFO L175 Difference]: Start difference. First operand has 228 places, 270 transitions, 3032 flow. Second operand 16 states and 1931 transitions. [2022-11-18 20:24:05,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 578 transitions, 10551 flow [2022-11-18 20:24:11,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 578 transitions, 9854 flow, removed 104 selfloop flow, removed 11 redundant places. [2022-11-18 20:24:11,463 INFO L231 Difference]: Finished difference. Result has 236 places, 237 transitions, 2297 flow [2022-11-18 20:24:11,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=2506, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2297, PETRI_PLACES=236, PETRI_TRANSITIONS=237} [2022-11-18 20:24:11,465 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 92 predicate places. [2022-11-18 20:24:11,465 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 2297 flow [2022-11-18 20:24:11,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:24:11,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:24:11,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:24:11,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:24:11,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:24:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:24:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1670550946, now seen corresponding path program 1 times [2022-11-18 20:24:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:24:11,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595698263] [2022-11-18 20:24:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:24:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:24:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:24:11,839 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-18 20:24:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:24:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595698263] [2022-11-18 20:24:11,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595698263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:24:11,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:24:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:24:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729650082] [2022-11-18 20:24:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:24:11,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:24:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:24:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:24:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:24:11,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-11-18 20:24:11,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 2297 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-18 20:24:11,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:24:11,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-11-18 20:24:11,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:24:15,893 INFO L130 PetriNetUnfolder]: 5807/18656 cut-off events. [2022-11-18 20:24:15,893 INFO L131 PetriNetUnfolder]: For 127611/137732 co-relation queries the response was YES. [2022-11-18 20:24:16,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79038 conditions, 18656 events. 5807/18656 cut-off events. For 127611/137732 co-relation queries the response was YES. Maximal size of possible extension queue 2502. Compared 264400 event pairs, 41 based on Foata normal form. 78/17446 useless extension candidates. Maximal degree in co-relation 78914. Up to 4809 conditions per place. [2022-11-18 20:24:16,203 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 83 selfloop transitions, 5 changer transitions 16/301 dead transitions. [2022-11-18 20:24:16,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 301 transitions, 3651 flow [2022-11-18 20:24:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:24:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 20:24:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2022-11-18 20:24:16,205 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2022-11-18 20:24:16,206 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2022-11-18 20:24:16,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2022-11-18 20:24:16,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:24:16,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2022-11-18 20:24:16,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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-18 20:24:16,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-18 20:24:16,211 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-18 20:24:16,211 INFO L175 Difference]: Start difference. First operand has 236 places, 237 transitions, 2297 flow. Second operand 7 states and 847 transitions. [2022-11-18 20:24:16,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 301 transitions, 3651 flow [2022-11-18 20:24:29,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 301 transitions, 3036 flow, removed 242 selfloop flow, removed 26 redundant places. [2022-11-18 20:24:29,795 INFO L231 Difference]: Finished difference. Result has 215 places, 241 transitions, 1985 flow [2022-11-18 20:24:29,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1985, PETRI_PLACES=215, PETRI_TRANSITIONS=241} [2022-11-18 20:24:29,796 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 71 predicate places. [2022-11-18 20:24:29,796 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 241 transitions, 1985 flow [2022-11-18 20:24:29,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-18 20:24:29,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:24:29,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:24:29,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:24:29,797 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:24:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:24:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1693419886, now seen corresponding path program 2 times [2022-11-18 20:24:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:24:29,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787732246] [2022-11-18 20:24:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:24:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:24:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:24:30,167 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-18 20:24:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:24:30,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787732246] [2022-11-18 20:24:30,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787732246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:24:30,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:24:30,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:24:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704427080] [2022-11-18 20:24:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:24:30,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:24:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:24:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:24:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:24:30,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 20:24:30,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 241 transitions, 1985 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 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-18 20:24:30,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:24:30,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 20:24:30,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:24:39,723 INFO L130 PetriNetUnfolder]: 20624/42753 cut-off events. [2022-11-18 20:24:39,723 INFO L131 PetriNetUnfolder]: For 416860/458201 co-relation queries the response was YES. [2022-11-18 20:24:40,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205562 conditions, 42753 events. 20624/42753 cut-off events. For 416860/458201 co-relation queries the response was YES. Maximal size of possible extension queue 3863. Compared 510335 event pairs, 294 based on Foata normal form. 4246/45205 useless extension candidates. Maximal degree in co-relation 205520. Up to 7420 conditions per place. [2022-11-18 20:24:40,277 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 94 selfloop transitions, 45 changer transitions 212/458 dead transitions. [2022-11-18 20:24:40,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 458 transitions, 5958 flow [2022-11-18 20:24:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:24:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 20:24:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2258 transitions. [2022-11-18 20:24:40,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8674606223588167 [2022-11-18 20:24:40,284 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2258 transitions. [2022-11-18 20:24:40,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2258 transitions. [2022-11-18 20:24:40,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:24:40,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2258 transitions. [2022-11-18 20:24:40,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.84210526315789) internal successors, (2258), 19 states have internal predecessors, (2258), 0 states have call successors, (0), 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-18 20:24:40,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-18 20:24:40,295 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-18 20:24:40,295 INFO L175 Difference]: Start difference. First operand has 215 places, 241 transitions, 1985 flow. Second operand 19 states and 2258 transitions. [2022-11-18 20:24:40,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 458 transitions, 5958 flow [2022-11-18 20:24:53,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 458 transitions, 5737 flow, removed 80 selfloop flow, removed 6 redundant places. [2022-11-18 20:24:53,441 INFO L231 Difference]: Finished difference. Result has 231 places, 182 transitions, 1289 flow [2022-11-18 20:24:53,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1289, PETRI_PLACES=231, PETRI_TRANSITIONS=182} [2022-11-18 20:24:53,442 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 87 predicate places. [2022-11-18 20:24:53,442 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 182 transitions, 1289 flow [2022-11-18 20:24:53,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 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-18 20:24:53,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:24:53,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:24:53,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:24:53,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:24:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:24:53,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1735455850, now seen corresponding path program 1 times [2022-11-18 20:24:53,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:24:53,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531085954] [2022-11-18 20:24:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:24:53,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:24:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:24:53,977 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-18 20:24:53,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:24:53,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531085954] [2022-11-18 20:24:53,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531085954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:24:53,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:24:53,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:24:53,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853535823] [2022-11-18 20:24:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:24:53,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:24:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:24:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:24:53,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:24:53,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 137 [2022-11-18 20:24:53,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 182 transitions, 1289 flow. Second operand has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 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-18 20:24:53,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:24:53,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 137 [2022-11-18 20:24:53,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:24:54,932 INFO L130 PetriNetUnfolder]: 1033/3879 cut-off events. [2022-11-18 20:24:54,933 INFO L131 PetriNetUnfolder]: For 11985/13033 co-relation queries the response was YES. [2022-11-18 20:24:54,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13064 conditions, 3879 events. 1033/3879 cut-off events. For 11985/13033 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 43164 event pairs, 16 based on Foata normal form. 3/3605 useless extension candidates. Maximal degree in co-relation 12940. Up to 414 conditions per place. [2022-11-18 20:24:54,969 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 30 selfloop transitions, 5 changer transitions 61/218 dead transitions. [2022-11-18 20:24:54,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 218 transitions, 1945 flow [2022-11-18 20:24:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:24:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:24:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions. [2022-11-18 20:24:54,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7737226277372263 [2022-11-18 20:24:54,971 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions. [2022-11-18 20:24:54,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions. [2022-11-18 20:24:54,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:24:54,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions. [2022-11-18 20:24:54,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-18 20:24:54,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 20:24:54,977 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 20:24:54,977 INFO L175 Difference]: Start difference. First operand has 231 places, 182 transitions, 1289 flow. Second operand 9 states and 954 transitions. [2022-11-18 20:24:54,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 218 transitions, 1945 flow [2022-11-18 20:24:55,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 218 transitions, 1556 flow, removed 110 selfloop flow, removed 28 redundant places. [2022-11-18 20:24:55,127 INFO L231 Difference]: Finished difference. Result has 206 places, 157 transitions, 774 flow [2022-11-18 20:24:55,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=206, PETRI_TRANSITIONS=157} [2022-11-18 20:24:55,128 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 62 predicate places. [2022-11-18 20:24:55,128 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 157 transitions, 774 flow [2022-11-18 20:24:55,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 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-18 20:24:55,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:24:55,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:24:55,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:24:55,129 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:24:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:24:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2055956318, now seen corresponding path program 2 times [2022-11-18 20:24:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:24:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025924340] [2022-11-18 20:24:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:24:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:24:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:24:55,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:24:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:24:55,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:24:55,246 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:24:55,247 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 20:24:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 20:24:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 20:24:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 20:24:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 20:24:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 20:24:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 20:24:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:24:55,253 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:24:55,262 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:24:55,262 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:24:55,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:24:55 BasicIcfg [2022-11-18 20:24:55,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:24:55,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:24:55,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:24:55,418 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:24:55,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:23:02" (3/4) ... [2022-11-18 20:24:55,421 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:24:55,538 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:24:55,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:24:55,539 INFO L158 Benchmark]: Toolchain (without parser) took 115800.87ms. Allocated memory was 92.3MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 60.6MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-18 20:24:55,539 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:24:55,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 906.01ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 56.0MB in the end (delta: 4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:24:55,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.96ms. Allocated memory is still 92.3MB. Free memory was 56.0MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:24:55,540 INFO L158 Benchmark]: Boogie Preprocessor took 70.66ms. Allocated memory is still 92.3MB. Free memory was 53.0MB in the beginning and 51.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:24:55,541 INFO L158 Benchmark]: RCFGBuilder took 1311.70ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 51.2MB in the beginning and 71.6MB in the end (delta: -20.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-11-18 20:24:55,541 INFO L158 Benchmark]: TraceAbstraction took 113283.96ms. Allocated memory was 121.6MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 70.7MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-18 20:24:55,541 INFO L158 Benchmark]: Witness Printer took 120.20ms. Allocated memory is still 12.6GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-18 20:24:55,543 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.34ms. Allocated memory is still 92.3MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 906.01ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 56.0MB in the end (delta: 4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.96ms. Allocated memory is still 92.3MB. Free memory was 56.0MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.66ms. Allocated memory is still 92.3MB. Free memory was 53.0MB in the beginning and 51.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1311.70ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 51.2MB in the beginning and 71.6MB in the end (delta: -20.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 113283.96ms. Allocated memory was 121.6MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 70.7MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 120.20ms. Allocated memory is still 12.6GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. 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: [L740] 0 _Bool z$r_buff1_thd4; VAL [z$r_buff1_thd4=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L747] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L745] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L748] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L743] 0 int z$w_buff0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L718] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L720] 0 int b = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 847]: 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: 849]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 112.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 97.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1362 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1362 mSDsluCounter, 1764 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1431 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2554 IncrementalHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 333 mSDtfsCounter, 2554 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3595occurred in iteration=10, InterpolantAutomatonStates: 211, 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.8s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1698 NumberOfCodeBlocks, 1698 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 7904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-18 20:24:55,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ba00cdf-aa0d-4e6c-bc06-5b6bd391da04/bin/uautomizer-TMbwUNV5ro/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