./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8 --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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- 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-e04fb08 [2022-11-16 12:20:26,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:20:26,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:20:26,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:20:26,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:20:26,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:20:26,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:20:26,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:20:26,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:20:26,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:20:26,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:20:26,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:20:26,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:20:26,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:20:26,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:20:26,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:20:26,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:20:26,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:20:26,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:20:26,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:20:26,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:20:26,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:20:26,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:20:26,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:20:26,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:20:26,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:20:26,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:20:26,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:20:26,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:20:26,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:20:26,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:20:26,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:20:26,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:20:26,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:20:26,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:20:26,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:20:26,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:20:26,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:20:26,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:20:26,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:20:26,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:20:26,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:20:26,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:20:26,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:20:26,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:20:26,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:20:26,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:20:26,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:20:26,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:20:26,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:20:26,468 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:20:26,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:20:26,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:20:26,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:20:26,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:20:26,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:20:26,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:20:26,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:20:26,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:20:26,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:20:26,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:20:26,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:20:26,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:20:26,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:20:26,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:20:26,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:20:26,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:20:26,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:20:26,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:20:26,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:20:26,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:20:26,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:20:26,474 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:20:26,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:20:26,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:20:26,475 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_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/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_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2022-11-16 12:20:26,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:20:26,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:20:26,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:20:26,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:20:26,800 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:20:26,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-11-16 12:20:26,875 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/data/291b2f62d/b3e9c71e1476407e92b30b5b2f7ec9f3/FLAGbb66213e3 [2022-11-16 12:20:27,500 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:20:27,500 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-11-16 12:20:27,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/data/291b2f62d/b3e9c71e1476407e92b30b5b2f7ec9f3/FLAGbb66213e3 [2022-11-16 12:20:27,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/data/291b2f62d/b3e9c71e1476407e92b30b5b2f7ec9f3 [2022-11-16 12:20:27,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:20:27,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:20:27,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:20:27,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:20:27,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:20:27,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:27" (1/1) ... [2022-11-16 12:20:27,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b2ea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27, skipping insertion in model container [2022-11-16 12:20:27,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:27" (1/1) ... [2022-11-16 12:20:27,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:20:27,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:20:28,072 WARN L229 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_18f62abe-233d-4b0c-9372-f15975a893bb/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-16 12:20:28,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:20:28,319 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:20:28,331 WARN L229 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_18f62abe-233d-4b0c-9372-f15975a893bb/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-16 12:20:28,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:20:28,449 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:20:28,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28 WrapperNode [2022-11-16 12:20:28,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:20:28,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:20:28,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:20:28,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:20:28,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,512 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-16 12:20:28,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:20:28,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:20:28,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:20:28,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:20:28,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:20:28,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:20:28,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:20:28,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:20:28,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (1/1) ... [2022-11-16 12:20:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:20:28,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:28,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:20:28,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:20:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:20:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:20:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:20:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:20:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:20:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:20:28,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:20:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:20:28,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:20:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:20:28,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:20:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:20:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:20:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:20:28,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:20:28,675 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:20:28,829 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:20:28,832 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:20:29,257 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:20:29,409 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:20:29,410 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:20:29,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:29 BoogieIcfgContainer [2022-11-16 12:20:29,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:20:29,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:20:29,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:20:29,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:20:29,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:20:27" (1/3) ... [2022-11-16 12:20:29,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363e14d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:29, skipping insertion in model container [2022-11-16 12:20:29,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:28" (2/3) ... [2022-11-16 12:20:29,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363e14d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:29, skipping insertion in model container [2022-11-16 12:20:29,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:29" (3/3) ... [2022-11-16 12:20:29,420 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-11-16 12:20:29,428 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:20:29,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:20:29,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:20:29,439 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:20:29,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:20:29,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 12:20:29,574 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-16 12:20:29,574 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:20:29,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-16 12:20:29,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 12:20:29,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-16 12:20:29,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:20:29,599 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;@21db832c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:20:29,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 12:20:29,615 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-11-16 12:20:29,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:20:29,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:29,616 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] [2022-11-16 12:20:29,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash -328562959, now seen corresponding path program 1 times [2022-11-16 12:20:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:29,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279748513] [2022-11-16 12:20:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:30,267 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-16 12:20:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:30,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279748513] [2022-11-16 12:20:30,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279748513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:30,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:30,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:20:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881933459] [2022-11-16 12:20:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:30,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:30,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-11-16 12:20:30,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-16 12:20:30,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:30,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-11-16 12:20:30,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:30,497 INFO L130 PetriNetUnfolder]: 57/323 cut-off events. [2022-11-16 12:20:30,497 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 12:20:30,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1330 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2022-11-16 12:20:30,503 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-11-16 12:20:30,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2022-11-16 12:20:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:20:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2022-11-16 12:20:30,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2022-11-16 12:20:30,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2022-11-16 12:20:30,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2022-11-16 12:20:30,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:30,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2022-11-16 12:20:30,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-16 12:20:30,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-16 12:20:30,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-16 12:20:30,549 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2022-11-16 12:20:30,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2022-11-16 12:20:30,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:20:30,561 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-16 12:20:30,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-16 12:20:30,567 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-16 12:20:30,568 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-16 12:20:30,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-16 12:20:30,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:30,569 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] [2022-11-16 12:20:30,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:20:30,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -393644177, now seen corresponding path program 1 times [2022-11-16 12:20:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:30,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509539447] [2022-11-16 12:20:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:31,650 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-16 12:20:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509539447] [2022-11-16 12:20:31,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509539447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:31,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:31,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:20:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859234426] [2022-11-16 12:20:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:31,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:20:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:20:31,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:20:31,655 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:31,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 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-16 12:20:31,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:31,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:31,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:33,458 INFO L130 PetriNetUnfolder]: 2377/5870 cut-off events. [2022-11-16 12:20:33,459 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-11-16 12:20:33,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9688 conditions, 5870 events. 2377/5870 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 50121 event pairs, 60 based on Foata normal form. 0/5701 useless extension candidates. Maximal degree in co-relation 9628. Up to 1340 conditions per place. [2022-11-16 12:20:33,496 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 37 selfloop transitions, 12 changer transitions 96/211 dead transitions. [2022-11-16 12:20:33,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 211 transitions, 722 flow [2022-11-16 12:20:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:20:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:20:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1177 transitions. [2022-11-16 12:20:33,503 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7941970310391363 [2022-11-16 12:20:33,504 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1177 transitions. [2022-11-16 12:20:33,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1177 transitions. [2022-11-16 12:20:33,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:33,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1177 transitions. [2022-11-16 12:20:33,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.53846153846153) internal successors, (1177), 13 states have internal predecessors, (1177), 0 states have call successors, (0), 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-16 12:20:33,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:33,514 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:33,514 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1177 transitions. [2022-11-16 12:20:33,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 211 transitions, 722 flow [2022-11-16 12:20:33,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 211 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:20:33,523 INFO L231 Difference]: Finished difference. Result has 138 places, 103 transitions, 340 flow [2022-11-16 12:20:33,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=340, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2022-11-16 12:20:33,524 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-11-16 12:20:33,525 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 340 flow [2022-11-16 12:20:33,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 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-16 12:20:33,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:33,526 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] [2022-11-16 12:20:33,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:20:33,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:33,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1891044304, now seen corresponding path program 1 times [2022-11-16 12:20:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:33,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631042112] [2022-11-16 12:20:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:34,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-16 12:20:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:34,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631042112] [2022-11-16 12:20:34,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631042112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:34,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:34,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:20:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289942250] [2022-11-16 12:20:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:34,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:20:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:20:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:20:34,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:34,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 340 flow. Second operand has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 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-16 12:20:34,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:34,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:34,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:35,522 INFO L130 PetriNetUnfolder]: 1852/3331 cut-off events. [2022-11-16 12:20:35,522 INFO L131 PetriNetUnfolder]: For 9056/16249 co-relation queries the response was YES. [2022-11-16 12:20:35,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13020 conditions, 3331 events. 1852/3331 cut-off events. For 9056/16249 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20200 event pairs, 89 based on Foata normal form. 78/3258 useless extension candidates. Maximal degree in co-relation 12944. Up to 1560 conditions per place. [2022-11-16 12:20:35,558 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 40 selfloop transitions, 15 changer transitions 99/220 dead transitions. [2022-11-16 12:20:35,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 220 transitions, 1504 flow [2022-11-16 12:20:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:20:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:20:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 989 transitions. [2022-11-16 12:20:35,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7886762360446571 [2022-11-16 12:20:35,564 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 989 transitions. [2022-11-16 12:20:35,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 989 transitions. [2022-11-16 12:20:35,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:35,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 989 transitions. [2022-11-16 12:20:35,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.9090909090909) internal successors, (989), 11 states have internal predecessors, (989), 0 states have call successors, (0), 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-16 12:20:35,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-16 12:20:35,574 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-16 12:20:35,574 INFO L175 Difference]: Start difference. First operand has 138 places, 103 transitions, 340 flow. Second operand 11 states and 989 transitions. [2022-11-16 12:20:35,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 220 transitions, 1504 flow [2022-11-16 12:20:35,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 220 transitions, 1481 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-16 12:20:35,602 INFO L231 Difference]: Finished difference. Result has 131 places, 105 transitions, 422 flow [2022-11-16 12:20:35,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=422, PETRI_PLACES=131, PETRI_TRANSITIONS=105} [2022-11-16 12:20:35,604 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2022-11-16 12:20:35,604 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 105 transitions, 422 flow [2022-11-16 12:20:35,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 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-16 12:20:35,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:35,606 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] [2022-11-16 12:20:35,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:20:35,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:35,607 INFO L85 PathProgramCache]: Analyzing trace with hash 216748685, now seen corresponding path program 1 times [2022-11-16 12:20:35,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:35,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408832558] [2022-11-16 12:20:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:36,968 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-16 12:20:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408832558] [2022-11-16 12:20:36,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408832558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:36,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:36,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:20:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699382579] [2022-11-16 12:20:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:36,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:20:36,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:20:36,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:20:36,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 114 [2022-11-16 12:20:36,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 105 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 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-16 12:20:36,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:36,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 114 [2022-11-16 12:20:36,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:38,911 INFO L130 PetriNetUnfolder]: 1396/2647 cut-off events. [2022-11-16 12:20:38,911 INFO L131 PetriNetUnfolder]: For 11477/16104 co-relation queries the response was YES. [2022-11-16 12:20:38,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11652 conditions, 2647 events. 1396/2647 cut-off events. For 11477/16104 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16153 event pairs, 30 based on Foata normal form. 58/2620 useless extension candidates. Maximal degree in co-relation 11567. Up to 1089 conditions per place. [2022-11-16 12:20:38,942 INFO L137 encePairwiseOnDemand]: 95/114 looper letters, 60 selfloop transitions, 36 changer transitions 120/283 dead transitions. [2022-11-16 12:20:38,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 283 transitions, 2322 flow [2022-11-16 12:20:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:20:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-16 12:20:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2036 transitions. [2022-11-16 12:20:38,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7765064836003052 [2022-11-16 12:20:38,949 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2036 transitions. [2022-11-16 12:20:38,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2036 transitions. [2022-11-16 12:20:38,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:38,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2036 transitions. [2022-11-16 12:20:38,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 88.52173913043478) internal successors, (2036), 23 states have internal predecessors, (2036), 0 states have call successors, (0), 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-16 12:20:38,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 114.0) internal successors, (2736), 24 states have internal predecessors, (2736), 0 states have call successors, (0), 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-16 12:20:38,969 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 114.0) internal successors, (2736), 24 states have internal predecessors, (2736), 0 states have call successors, (0), 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-16 12:20:38,969 INFO L175 Difference]: Start difference. First operand has 131 places, 105 transitions, 422 flow. Second operand 23 states and 2036 transitions. [2022-11-16 12:20:38,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 283 transitions, 2322 flow [2022-11-16 12:20:39,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 283 transitions, 2102 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-11-16 12:20:39,006 INFO L231 Difference]: Finished difference. Result has 161 places, 131 transitions, 846 flow [2022-11-16 12:20:39,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=846, PETRI_PLACES=161, PETRI_TRANSITIONS=131} [2022-11-16 12:20:39,008 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2022-11-16 12:20:39,013 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 131 transitions, 846 flow [2022-11-16 12:20:39,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 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-16 12:20:39,014 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:39,014 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:39,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:20:39,015 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:39,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2101664039, now seen corresponding path program 1 times [2022-11-16 12:20:39,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:39,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589728250] [2022-11-16 12:20:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:40,549 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-16 12:20:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589728250] [2022-11-16 12:20:40,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589728250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:40,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:40,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:20:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754878701] [2022-11-16 12:20:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:40,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:20:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:20:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:20:40,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:40,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 131 transitions, 846 flow. Second operand has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 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-16 12:20:40,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:40,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:40,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:41,906 INFO L130 PetriNetUnfolder]: 1308/2471 cut-off events. [2022-11-16 12:20:41,906 INFO L131 PetriNetUnfolder]: For 33742/40050 co-relation queries the response was YES. [2022-11-16 12:20:41,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16039 conditions, 2471 events. 1308/2471 cut-off events. For 33742/40050 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14146 event pairs, 46 based on Foata normal form. 89/2472 useless extension candidates. Maximal degree in co-relation 15932. Up to 1049 conditions per place. [2022-11-16 12:20:41,949 INFO L137 encePairwiseOnDemand]: 94/114 looper letters, 85 selfloop transitions, 61 changer transitions 101/313 dead transitions. [2022-11-16 12:20:41,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 313 transitions, 3718 flow [2022-11-16 12:20:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:20:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-16 12:20:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1601 transitions. [2022-11-16 12:20:41,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.780214424951267 [2022-11-16 12:20:41,954 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1601 transitions. [2022-11-16 12:20:41,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1601 transitions. [2022-11-16 12:20:41,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:41,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1601 transitions. [2022-11-16 12:20:41,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 88.94444444444444) internal successors, (1601), 18 states have internal predecessors, (1601), 0 states have call successors, (0), 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-16 12:20:41,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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-16 12:20:41,965 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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-16 12:20:41,965 INFO L175 Difference]: Start difference. First operand has 161 places, 131 transitions, 846 flow. Second operand 18 states and 1601 transitions. [2022-11-16 12:20:41,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 313 transitions, 3718 flow [2022-11-16 12:20:42,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 313 transitions, 3427 flow, removed 144 selfloop flow, removed 11 redundant places. [2022-11-16 12:20:42,045 INFO L231 Difference]: Finished difference. Result has 167 places, 170 transitions, 1625 flow [2022-11-16 12:20:42,045 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1625, PETRI_PLACES=167, PETRI_TRANSITIONS=170} [2022-11-16 12:20:42,049 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2022-11-16 12:20:42,049 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 170 transitions, 1625 flow [2022-11-16 12:20:42,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 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-16 12:20:42,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:42,050 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:20:42,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash -48361874, now seen corresponding path program 1 times [2022-11-16 12:20:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:42,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266960055] [2022-11-16 12:20:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:42,665 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-16 12:20:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:42,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266960055] [2022-11-16 12:20:42,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266960055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:42,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:42,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:20:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104163056] [2022-11-16 12:20:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:42,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:20:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:20:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:20:42,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:42,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 170 transitions, 1625 flow. Second operand has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 0 states have call successors, (0), 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-16 12:20:42,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:42,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:42,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:44,070 INFO L130 PetriNetUnfolder]: 1585/3117 cut-off events. [2022-11-16 12:20:44,070 INFO L131 PetriNetUnfolder]: For 48479/97177 co-relation queries the response was YES. [2022-11-16 12:20:44,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22565 conditions, 3117 events. 1585/3117 cut-off events. For 48479/97177 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19545 event pairs, 39 based on Foata normal form. 126/3093 useless extension candidates. Maximal degree in co-relation 22443. Up to 1439 conditions per place. [2022-11-16 12:20:44,117 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 76 selfloop transitions, 45 changer transitions 188/375 dead transitions. [2022-11-16 12:20:44,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 375 transitions, 5338 flow [2022-11-16 12:20:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:20:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:20:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1168 transitions. [2022-11-16 12:20:44,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7881241565452092 [2022-11-16 12:20:44,121 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1168 transitions. [2022-11-16 12:20:44,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1168 transitions. [2022-11-16 12:20:44,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:44,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1168 transitions. [2022-11-16 12:20:44,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.84615384615384) internal successors, (1168), 13 states have internal predecessors, (1168), 0 states have call successors, (0), 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-16 12:20:44,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:44,129 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:44,129 INFO L175 Difference]: Start difference. First operand has 167 places, 170 transitions, 1625 flow. Second operand 13 states and 1168 transitions. [2022-11-16 12:20:44,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 375 transitions, 5338 flow [2022-11-16 12:20:44,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 375 transitions, 5117 flow, removed 109 selfloop flow, removed 5 redundant places. [2022-11-16 12:20:44,246 INFO L231 Difference]: Finished difference. Result has 175 places, 154 transitions, 1461 flow [2022-11-16 12:20:44,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1461, PETRI_PLACES=175, PETRI_TRANSITIONS=154} [2022-11-16 12:20:44,249 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 56 predicate places. [2022-11-16 12:20:44,249 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 154 transitions, 1461 flow [2022-11-16 12:20:44,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 0 states have call successors, (0), 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-16 12:20:44,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:44,250 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:44,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:20:44,250 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2056880049, now seen corresponding path program 1 times [2022-11-16 12:20:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:44,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025619100] [2022-11-16 12:20:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:44,898 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-16 12:20:44,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:44,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025619100] [2022-11-16 12:20:44,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025619100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:44,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:44,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:20:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250416384] [2022-11-16 12:20:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:44,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:20:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:20:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:20:44,914 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:44,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 154 transitions, 1461 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 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-16 12:20:44,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:44,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:44,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:46,040 INFO L130 PetriNetUnfolder]: 779/1579 cut-off events. [2022-11-16 12:20:46,041 INFO L131 PetriNetUnfolder]: For 27219/48105 co-relation queries the response was YES. [2022-11-16 12:20:46,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11799 conditions, 1579 events. 779/1579 cut-off events. For 27219/48105 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8487 event pairs, 40 based on Foata normal form. 66/1588 useless extension candidates. Maximal degree in co-relation 11664. Up to 736 conditions per place. [2022-11-16 12:20:46,067 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 56 selfloop transitions, 22 changer transitions 94/238 dead transitions. [2022-11-16 12:20:46,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 238 transitions, 3113 flow [2022-11-16 12:20:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:20:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:20:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1145 transitions. [2022-11-16 12:20:46,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7726045883940621 [2022-11-16 12:20:46,072 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1145 transitions. [2022-11-16 12:20:46,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1145 transitions. [2022-11-16 12:20:46,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:46,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1145 transitions. [2022-11-16 12:20:46,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.07692307692308) internal successors, (1145), 13 states have internal predecessors, (1145), 0 states have call successors, (0), 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-16 12:20:46,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:46,081 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:46,082 INFO L175 Difference]: Start difference. First operand has 175 places, 154 transitions, 1461 flow. Second operand 13 states and 1145 transitions. [2022-11-16 12:20:46,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 238 transitions, 3113 flow [2022-11-16 12:20:46,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 238 transitions, 2879 flow, removed 117 selfloop flow, removed 15 redundant places. [2022-11-16 12:20:46,142 INFO L231 Difference]: Finished difference. Result has 174 places, 131 transitions, 1069 flow [2022-11-16 12:20:46,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1069, PETRI_PLACES=174, PETRI_TRANSITIONS=131} [2022-11-16 12:20:46,143 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2022-11-16 12:20:46,143 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 131 transitions, 1069 flow [2022-11-16 12:20:46,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 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-16 12:20:46,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:46,144 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] [2022-11-16 12:20:46,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:20:46,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 285535428, now seen corresponding path program 1 times [2022-11-16 12:20:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:46,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285939263] [2022-11-16 12:20:46,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:46,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:46,787 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-16 12:20:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:46,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285939263] [2022-11-16 12:20:46,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285939263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:46,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:46,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:20:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289119433] [2022-11-16 12:20:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:20:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:20:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:20:46,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:46,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 131 transitions, 1069 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 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-16 12:20:46,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:46,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:46,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:47,540 INFO L130 PetriNetUnfolder]: 377/863 cut-off events. [2022-11-16 12:20:47,540 INFO L131 PetriNetUnfolder]: For 12248/16137 co-relation queries the response was YES. [2022-11-16 12:20:47,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5823 conditions, 863 events. 377/863 cut-off events. For 12248/16137 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4236 event pairs, 15 based on Foata normal form. 36/880 useless extension candidates. Maximal degree in co-relation 5687. Up to 378 conditions per place. [2022-11-16 12:20:47,553 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 62 selfloop transitions, 21 changer transitions 46/195 dead transitions. [2022-11-16 12:20:47,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 195 transitions, 2345 flow [2022-11-16 12:20:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:20:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:20:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1129 transitions. [2022-11-16 12:20:47,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.761808367071525 [2022-11-16 12:20:47,558 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1129 transitions. [2022-11-16 12:20:47,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1129 transitions. [2022-11-16 12:20:47,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:47,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1129 transitions. [2022-11-16 12:20:47,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 86.84615384615384) internal successors, (1129), 13 states have internal predecessors, (1129), 0 states have call successors, (0), 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-16 12:20:47,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:47,567 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:47,567 INFO L175 Difference]: Start difference. First operand has 174 places, 131 transitions, 1069 flow. Second operand 13 states and 1129 transitions. [2022-11-16 12:20:47,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 195 transitions, 2345 flow [2022-11-16 12:20:47,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 195 transitions, 2066 flow, removed 103 selfloop flow, removed 22 redundant places. [2022-11-16 12:20:47,598 INFO L231 Difference]: Finished difference. Result has 164 places, 137 transitions, 1142 flow [2022-11-16 12:20:47,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1142, PETRI_PLACES=164, PETRI_TRANSITIONS=137} [2022-11-16 12:20:47,599 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 45 predicate places. [2022-11-16 12:20:47,600 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 137 transitions, 1142 flow [2022-11-16 12:20:47,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 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-16 12:20:47,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:47,601 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] [2022-11-16 12:20:47,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:20:47,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1061895954, now seen corresponding path program 1 times [2022-11-16 12:20:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239834955] [2022-11-16 12:20:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:48,831 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-16 12:20:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:48,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239834955] [2022-11-16 12:20:48,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239834955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:48,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:48,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:20:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165292394] [2022-11-16 12:20:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:48,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:20:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:20:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:20:48,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 12:20:48,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 137 transitions, 1142 flow. Second operand has 11 states, 11 states have (on average 82.27272727272727) internal successors, (905), 11 states have internal predecessors, (905), 0 states have call successors, (0), 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-16 12:20:48,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:48,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 12:20:48,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:49,558 INFO L130 PetriNetUnfolder]: 294/690 cut-off events. [2022-11-16 12:20:49,558 INFO L131 PetriNetUnfolder]: For 7155/11581 co-relation queries the response was YES. [2022-11-16 12:20:49,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 690 events. 294/690 cut-off events. For 7155/11581 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3086 event pairs, 43 based on Foata normal form. 43/716 useless extension candidates. Maximal degree in co-relation 4249. Up to 330 conditions per place. [2022-11-16 12:20:49,567 INFO L137 encePairwiseOnDemand]: 95/114 looper letters, 44 selfloop transitions, 61 changer transitions 31/202 dead transitions. [2022-11-16 12:20:49,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 202 transitions, 2374 flow [2022-11-16 12:20:49,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:20:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 12:20:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1202 transitions. [2022-11-16 12:20:49,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7531328320802005 [2022-11-16 12:20:49,571 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1202 transitions. [2022-11-16 12:20:49,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1202 transitions. [2022-11-16 12:20:49,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:49,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1202 transitions. [2022-11-16 12:20:49,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 85.85714285714286) internal successors, (1202), 14 states have internal predecessors, (1202), 0 states have call successors, (0), 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-16 12:20:49,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-16 12:20:49,578 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-16 12:20:49,579 INFO L175 Difference]: Start difference. First operand has 164 places, 137 transitions, 1142 flow. Second operand 14 states and 1202 transitions. [2022-11-16 12:20:49,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 202 transitions, 2374 flow [2022-11-16 12:20:49,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 202 transitions, 2205 flow, removed 61 selfloop flow, removed 16 redundant places. [2022-11-16 12:20:49,599 INFO L231 Difference]: Finished difference. Result has 161 places, 163 transitions, 1801 flow [2022-11-16 12:20:49,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1801, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2022-11-16 12:20:49,600 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2022-11-16 12:20:49,601 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 1801 flow [2022-11-16 12:20:49,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.27272727272727) internal successors, (905), 11 states have internal predecessors, (905), 0 states have call successors, (0), 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-16 12:20:49,601 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:49,601 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] [2022-11-16 12:20:49,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:20:49,602 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 52175746, now seen corresponding path program 1 times [2022-11-16 12:20:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:49,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365615465] [2022-11-16 12:20:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:49,802 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-16 12:20:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:49,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365615465] [2022-11-16 12:20:49,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365615465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:49,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:49,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:20:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612601703] [2022-11-16 12:20:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:20:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:20:49,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:20:49,810 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 12:20:49,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 1801 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-16 12:20:49,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:49,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 12:20:49,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:50,545 INFO L130 PetriNetUnfolder]: 1203/2337 cut-off events. [2022-11-16 12:20:50,545 INFO L131 PetriNetUnfolder]: For 47043/49191 co-relation queries the response was YES. [2022-11-16 12:20:50,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13582 conditions, 2337 events. 1203/2337 cut-off events. For 47043/49191 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14613 event pairs, 56 based on Foata normal form. 168/2390 useless extension candidates. Maximal degree in co-relation 13464. Up to 896 conditions per place. [2022-11-16 12:20:50,566 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 56 selfloop transitions, 7 changer transitions 88/235 dead transitions. [2022-11-16 12:20:50,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 235 transitions, 3152 flow [2022-11-16 12:20:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:20:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:20:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2022-11-16 12:20:50,570 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2022-11-16 12:20:50,570 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2022-11-16 12:20:50,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2022-11-16 12:20:50,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:50,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2022-11-16 12:20:50,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 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-16 12:20:50,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-16 12:20:50,576 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-16 12:20:50,576 INFO L175 Difference]: Start difference. First operand has 161 places, 163 transitions, 1801 flow. Second operand 10 states and 976 transitions. [2022-11-16 12:20:50,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 235 transitions, 3152 flow [2022-11-16 12:20:50,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 235 transitions, 2624 flow, removed 103 selfloop flow, removed 19 redundant places. [2022-11-16 12:20:50,610 INFO L231 Difference]: Finished difference. Result has 151 places, 129 transitions, 958 flow [2022-11-16 12:20:50,610 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=958, PETRI_PLACES=151, PETRI_TRANSITIONS=129} [2022-11-16 12:20:50,611 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-11-16 12:20:50,612 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 129 transitions, 958 flow [2022-11-16 12:20:50,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-16 12:20:50,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:50,613 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] [2022-11-16 12:20:50,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:20:50,613 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash 407527143, now seen corresponding path program 1 times [2022-11-16 12:20:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:50,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551306573] [2022-11-16 12:20:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:50,830 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-16 12:20:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551306573] [2022-11-16 12:20:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551306573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:50,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:50,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:20:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217032997] [2022-11-16 12:20:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:50,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:20:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:20:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:20:50,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 12:20:50,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 129 transitions, 958 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 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-16 12:20:50,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:50,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 12:20:50,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:51,308 INFO L130 PetriNetUnfolder]: 483/1163 cut-off events. [2022-11-16 12:20:51,309 INFO L131 PetriNetUnfolder]: For 12436/13295 co-relation queries the response was YES. [2022-11-16 12:20:51,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 1163 events. 483/1163 cut-off events. For 12436/13295 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6856 event pairs, 30 based on Foata normal form. 59/1199 useless extension candidates. Maximal degree in co-relation 5932. Up to 384 conditions per place. [2022-11-16 12:20:51,320 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 58 selfloop transitions, 11 changer transitions 47/200 dead transitions. [2022-11-16 12:20:51,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 2076 flow [2022-11-16 12:20:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:20:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:20:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1072 transitions. [2022-11-16 12:20:51,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8548644338118022 [2022-11-16 12:20:51,324 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1072 transitions. [2022-11-16 12:20:51,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1072 transitions. [2022-11-16 12:20:51,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:51,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1072 transitions. [2022-11-16 12:20:51,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.45454545454545) internal successors, (1072), 11 states have internal predecessors, (1072), 0 states have call successors, (0), 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-16 12:20:51,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-16 12:20:51,334 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-16 12:20:51,334 INFO L175 Difference]: Start difference. First operand has 151 places, 129 transitions, 958 flow. Second operand 11 states and 1072 transitions. [2022-11-16 12:20:51,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 2076 flow [2022-11-16 12:20:51,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 200 transitions, 2060 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 12:20:51,351 INFO L231 Difference]: Finished difference. Result has 160 places, 133 transitions, 1021 flow [2022-11-16 12:20:51,351 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1021, PETRI_PLACES=160, PETRI_TRANSITIONS=133} [2022-11-16 12:20:51,352 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2022-11-16 12:20:51,352 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 133 transitions, 1021 flow [2022-11-16 12:20:51,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 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-16 12:20:51,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:51,353 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] [2022-11-16 12:20:51,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:20:51,353 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -91224254, now seen corresponding path program 1 times [2022-11-16 12:20:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:51,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627090664] [2022-11-16 12:20:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:51,665 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-16 12:20:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627090664] [2022-11-16 12:20:51,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627090664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:51,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:51,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:20:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937687351] [2022-11-16 12:20:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:51,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:20:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:51,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:20:51,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:20:51,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 12:20:51,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 133 transitions, 1021 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 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-16 12:20:51,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:51,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 12:20:51,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:52,120 INFO L130 PetriNetUnfolder]: 335/893 cut-off events. [2022-11-16 12:20:52,120 INFO L131 PetriNetUnfolder]: For 11178/12016 co-relation queries the response was YES. [2022-11-16 12:20:52,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 893 events. 335/893 cut-off events. For 11178/12016 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5713 event pairs, 18 based on Foata normal form. 47/915 useless extension candidates. Maximal degree in co-relation 4885. Up to 317 conditions per place. [2022-11-16 12:20:52,127 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 47 selfloop transitions, 14 changer transitions 36/181 dead transitions. [2022-11-16 12:20:52,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 1911 flow [2022-11-16 12:20:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:20:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:20:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1236 transitions. [2022-11-16 12:20:52,131 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8340080971659919 [2022-11-16 12:20:52,131 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1236 transitions. [2022-11-16 12:20:52,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1236 transitions. [2022-11-16 12:20:52,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:52,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1236 transitions. [2022-11-16 12:20:52,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 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-16 12:20:52,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:52,138 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-16 12:20:52,138 INFO L175 Difference]: Start difference. First operand has 160 places, 133 transitions, 1021 flow. Second operand 13 states and 1236 transitions. [2022-11-16 12:20:52,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 1911 flow [2022-11-16 12:20:52,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 181 transitions, 1815 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-11-16 12:20:52,160 INFO L231 Difference]: Finished difference. Result has 164 places, 132 transitions, 961 flow [2022-11-16 12:20:52,160 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=961, PETRI_PLACES=164, PETRI_TRANSITIONS=132} [2022-11-16 12:20:52,161 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 45 predicate places. [2022-11-16 12:20:52,161 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 132 transitions, 961 flow [2022-11-16 12:20:52,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 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-16 12:20:52,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:52,162 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] [2022-11-16 12:20:52,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:20:52,162 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash -19325476, now seen corresponding path program 1 times [2022-11-16 12:20:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:52,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250357217] [2022-11-16 12:20:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:53,652 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-16 12:20:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:53,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250357217] [2022-11-16 12:20:53,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250357217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:53,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:53,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 12:20:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987282651] [2022-11-16 12:20:53,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:53,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:20:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:53,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:20:53,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:20:53,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-16 12:20:53,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 132 transitions, 961 flow. Second operand has 16 states, 16 states have (on average 86.5) internal successors, (1384), 16 states have internal predecessors, (1384), 0 states have call successors, (0), 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-16 12:20:53,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:20:53,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-16 12:20:53,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:20:54,251 INFO L130 PetriNetUnfolder]: 89/603 cut-off events. [2022-11-16 12:20:54,251 INFO L131 PetriNetUnfolder]: For 2183/2246 co-relation queries the response was YES. [2022-11-16 12:20:54,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 603 events. 89/603 cut-off events. For 2183/2246 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4443 event pairs, 1 based on Foata normal form. 5/575 useless extension candidates. Maximal degree in co-relation 2017. Up to 120 conditions per place. [2022-11-16 12:20:54,258 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 30 selfloop transitions, 8 changer transitions 29/152 dead transitions. [2022-11-16 12:20:54,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 152 transitions, 1289 flow [2022-11-16 12:20:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:20:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 12:20:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1232 transitions. [2022-11-16 12:20:54,261 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2022-11-16 12:20:54,261 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1232 transitions. [2022-11-16 12:20:54,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1232 transitions. [2022-11-16 12:20:54,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:20:54,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1232 transitions. [2022-11-16 12:20:54,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.0) internal successors, (1232), 14 states have internal predecessors, (1232), 0 states have call successors, (0), 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-16 12:20:54,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-16 12:20:54,270 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-16 12:20:54,270 INFO L175 Difference]: Start difference. First operand has 164 places, 132 transitions, 961 flow. Second operand 14 states and 1232 transitions. [2022-11-16 12:20:54,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 152 transitions, 1289 flow [2022-11-16 12:20:54,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 1146 flow, removed 56 selfloop flow, removed 17 redundant places. [2022-11-16 12:20:54,288 INFO L231 Difference]: Finished difference. Result has 162 places, 122 transitions, 709 flow [2022-11-16 12:20:54,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=709, PETRI_PLACES=162, PETRI_TRANSITIONS=122} [2022-11-16 12:20:54,289 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places. [2022-11-16 12:20:54,289 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 122 transitions, 709 flow [2022-11-16 12:20:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 86.5) internal successors, (1384), 16 states have internal predecessors, (1384), 0 states have call successors, (0), 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-16 12:20:54,290 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:20:54,291 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] [2022-11-16 12:20:54,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:20:54,291 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:20:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1079701378, now seen corresponding path program 2 times [2022-11-16 12:20:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:54,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193662333] [2022-11-16 12:20:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:20:54,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:20:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:20:54,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:20:54,451 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:20:54,453 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 12:20:54,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 12:20:54,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 12:20:54,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 12:20:54,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 12:20:54,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 12:20:54,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:20:54,469 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:54,478 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:20:54,478 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:20:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:20:54 BasicIcfg [2022-11-16 12:20:54,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:20:54,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:20:54,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:20:54,627 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:20:54,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:29" (3/4) ... [2022-11-16 12:20:54,630 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:20:54,767 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:20:54,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:20:54,769 INFO L158 Benchmark]: Toolchain (without parser) took 26968.02ms. Allocated memory was 111.1MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 72.1MB in the beginning and 452.1MB in the end (delta: -380.1MB). Peak memory consumption was 541.6MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,769 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 111.1MB. Free memory was 91.2MB in the beginning and 91.1MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:20:54,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.18ms. Allocated memory is still 111.1MB. Free memory was 71.9MB in the beginning and 73.2MB in the end (delta: -1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.19ms. Allocated memory is still 111.1MB. Free memory was 73.2MB in the beginning and 70.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,771 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 111.1MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,771 INFO L158 Benchmark]: RCFGBuilder took 868.53ms. Allocated memory is still 111.1MB. Free memory was 68.4MB in the beginning and 75.4MB in the end (delta: -7.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,772 INFO L158 Benchmark]: TraceAbstraction took 25212.07ms. Allocated memory was 111.1MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 74.3MB in the beginning and 474.1MB in the end (delta: -399.8MB). Peak memory consumption was 523.5MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,772 INFO L158 Benchmark]: Witness Printer took 141.01ms. Allocated memory is still 1.0GB. Free memory was 474.1MB in the beginning and 452.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-16 12:20:54,775 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.19ms. Allocated memory is still 111.1MB. Free memory was 91.2MB in the beginning and 91.1MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.18ms. Allocated memory is still 111.1MB. Free memory was 71.9MB in the beginning and 73.2MB in the end (delta: -1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.19ms. Allocated memory is still 111.1MB. Free memory was 73.2MB in the beginning and 70.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 111.1MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 868.53ms. Allocated memory is still 111.1MB. Free memory was 68.4MB in the beginning and 75.4MB in the end (delta: -7.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25212.07ms. Allocated memory was 111.1MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 74.3MB in the beginning and 474.1MB in the end (delta: -399.8MB). Peak memory consumption was 523.5MB. Max. memory is 16.1GB. * Witness Printer took 141.01ms. Allocated memory is still 1.0GB. Free memory was 474.1MB in the beginning and 452.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1876; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1878; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1185 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1185 mSDsluCounter, 1262 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1008 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1942 IncrementalHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 254 mSDtfsCounter, 1942 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1801occurred in iteration=9, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 998 ConstructedInterpolants, 0 QuantifiedInterpolants, 5998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:20:54,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18f62abe-233d-4b0c-9372-f15975a893bb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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