./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044.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_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- 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 19:28:26,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:28:26,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:28:26,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:28:26,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:28:26,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:28:26,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:28:26,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:28:26,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:28:26,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:28:26,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:28:26,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:28:26,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:28:26,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:28:26,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:28:26,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:28:26,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:28:26,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:28:26,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:28:26,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:28:26,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:28:26,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:28:26,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:28:26,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:28:26,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:28:26,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:28:26,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:28:26,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:28:26,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:28:26,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:28:26,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:28:26,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:28:26,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:28:26,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:28:26,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:28:26,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:28:26,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:28:26,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:28:26,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:28:26,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:28:26,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:28:26,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 19:28:26,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:28:26,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:28:26,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:28:26,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:28:26,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:28:26,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:28:26,462 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:28:26,463 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:28:26,463 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:28:26,463 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:28:26,464 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:28:26,464 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:28:26,464 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:28:26,464 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:28:26,465 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:28:26,465 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:28:26,465 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:28:26,465 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:28:26,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:28:26,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:28:26,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:28:26,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:28:26,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:28:26,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 19:28:26,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:28:26,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 19:28:26,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:28:26,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 19:28:26,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:28:26,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 19:28:26,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:28:26,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:28:26,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:28:26,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:28:26,486 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:28:26,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:28:26,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 19:28:26,487 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:28:26,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:28:26,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 19:28:26,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:28:26,488 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_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/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_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0 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 -> Taipan 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2022-11-16 19:28:26,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:28:26,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:28:26,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:28:26,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:28:26,862 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:28:26,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-16 19:28:26,952 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/data/186c9fac8/a3301045dc2d481d86ed420ee8893b78/FLAGbf944901a [2022-11-16 19:28:27,717 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:28:27,717 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-16 19:28:27,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/data/186c9fac8/a3301045dc2d481d86ed420ee8893b78/FLAGbf944901a [2022-11-16 19:28:27,939 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/data/186c9fac8/a3301045dc2d481d86ed420ee8893b78 [2022-11-16 19:28:27,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:28:27,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:28:27,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:28:27,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:28:27,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:28:27,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:28:27" (1/1) ... [2022-11-16 19:28:27,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5719e20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:27, skipping insertion in model container [2022-11-16 19:28:27,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:28:27" (1/1) ... [2022-11-16 19:28:27,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:28:28,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:28:28,350 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_994a8947-1a2e-4784-b259-64dcf4c708b1/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-16 19:28:28,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:28:28,641 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:28:28,659 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_994a8947-1a2e-4784-b259-64dcf4c708b1/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-16 19:28:28,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:28:28,801 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:28:28,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28 WrapperNode [2022-11-16 19:28:28,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:28:28,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:28:28,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:28:28,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:28:28,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,862 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-16 19:28:28,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:28:28,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:28:28,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:28:28,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:28:28,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:28:28,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:28:28,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:28:28,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:28:28,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (1/1) ... [2022-11-16 19:28:28,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:28:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:28:28,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:28:28,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:28:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 19:28:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 19:28:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:28:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:28:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:28:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 19:28:29,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 19:28:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 19:28:29,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 19:28:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 19:28:29,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 19:28:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 19:28:29,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 19:28:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:28:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 19:28:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:28:29,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:28:29,021 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 19:28:29,193 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:28:29,196 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:28:29,621 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:28:29,894 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:28:29,901 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 19:28:29,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:28:29 BoogieIcfgContainer [2022-11-16 19:28:29,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:28:29,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:28:29,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:28:29,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:28:29,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:28:27" (1/3) ... [2022-11-16 19:28:29,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cdc02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:28:29, skipping insertion in model container [2022-11-16 19:28:29,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:28" (2/3) ... [2022-11-16 19:28:29,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cdc02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:28:29, skipping insertion in model container [2022-11-16 19:28:29,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:28:29" (3/3) ... [2022-11-16 19:28:29,919 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-11-16 19:28:29,931 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 19:28:29,944 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:28:29,945 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 19:28:29,945 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 19:28:30,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 19:28:30,110 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 19:28:30,128 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-16 19:28:30,131 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-16 19:28:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-16 19:28:30,228 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-16 19:28:30,229 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 19:28:30,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-16 19:28:30,243 INFO L119 LiptonReduction]: Number of co-enabled transitions 3168 [2022-11-16 19:28:36,697 INFO L134 LiptonReduction]: Checked pairs total: 7937 [2022-11-16 19:28:36,697 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-16 19:28:36,707 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2022-11-16 19:28:36,993 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 states 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 19:28:37,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:28:37,038 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=FINITE_AUTOMATA, 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;@3edf7245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:28:37,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 19:28:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 states 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 19:28:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 19:28:37,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:37,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:37,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1318132376, now seen corresponding path program 1 times [2022-11-16 19:28:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:37,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115212431] [2022-11-16 19:28:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:37,677 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 19:28:37,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:37,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115212431] [2022-11-16 19:28:37,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115212431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:37,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:37,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:28:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434345108] [2022-11-16 19:28:37,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:37,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:28:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:28:37,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:28:37,751 INFO L87 Difference]: Start difference. First operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 19:28:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:37,956 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2022-11-16 19:28:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:28:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 19:28:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:38,002 INFO L225 Difference]: With dead ends: 2682 [2022-11-16 19:28:38,003 INFO L226 Difference]: Without dead ends: 2602 [2022-11-16 19:28:38,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:28:38,008 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:38,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:28:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-11-16 19:28:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2022-11-16 19:28:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.869281045751634) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states 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 19:28:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2022-11-16 19:28:38,337 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2022-11-16 19:28:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:38,339 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2022-11-16 19:28:38,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 19:28:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2022-11-16 19:28:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 19:28:38,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:38,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:38,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:28:38,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash 407327058, now seen corresponding path program 1 times [2022-11-16 19:28:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:38,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707717278] [2022-11-16 19:28:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:28:39,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:39,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707717278] [2022-11-16 19:28:39,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707717278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:39,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:39,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:28:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849698606] [2022-11-16 19:28:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:39,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:28:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:28:39,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:28:39,866 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 19:28:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:40,469 INFO L93 Difference]: Finished difference Result 4344 states and 15901 transitions. [2022-11-16 19:28:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:28:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 19:28:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:40,503 INFO L225 Difference]: With dead ends: 4344 [2022-11-16 19:28:40,503 INFO L226 Difference]: Without dead ends: 3614 [2022-11-16 19:28:40,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:28:40,506 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:40,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 17 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:28:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3614 states. [2022-11-16 19:28:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3614 to 2706. [2022-11-16 19:28:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 3.756007393715342) internal successors, (10160), 2705 states have internal predecessors, (10160), 0 states have call successors, (0), 0 states 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 19:28:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 10160 transitions. [2022-11-16 19:28:40,681 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 10160 transitions. Word has length 12 [2022-11-16 19:28:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:40,682 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 10160 transitions. [2022-11-16 19:28:40,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 19:28:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 10160 transitions. [2022-11-16 19:28:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 19:28:40,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:40,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:28:40,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash 828470414, now seen corresponding path program 1 times [2022-11-16 19:28:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:40,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468661658] [2022-11-16 19:28:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:41,941 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 19:28:41,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:41,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468661658] [2022-11-16 19:28:41,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468661658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:41,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:41,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:28:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701193918] [2022-11-16 19:28:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:41,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:28:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:28:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:28:41,944 INFO L87 Difference]: Start difference. First operand 2706 states and 10160 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 19:28:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:42,438 INFO L93 Difference]: Finished difference Result 3526 states and 12716 transitions. [2022-11-16 19:28:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:28:42,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 19:28:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:42,498 INFO L225 Difference]: With dead ends: 3526 [2022-11-16 19:28:42,498 INFO L226 Difference]: Without dead ends: 2986 [2022-11-16 19:28:42,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:28:42,503 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:42,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:28:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2022-11-16 19:28:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2346. [2022-11-16 19:28:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.7236673773987206) internal successors, (8732), 2345 states have internal predecessors, (8732), 0 states have call successors, (0), 0 states 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 19:28:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8732 transitions. [2022-11-16 19:28:42,628 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8732 transitions. Word has length 13 [2022-11-16 19:28:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:42,628 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 8732 transitions. [2022-11-16 19:28:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 19:28:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8732 transitions. [2022-11-16 19:28:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:28:42,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:42,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:42,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:28:42,634 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1589581448, now seen corresponding path program 1 times [2022-11-16 19:28:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968199299] [2022-11-16 19:28:42,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:45,023 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 19:28:45,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:45,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968199299] [2022-11-16 19:28:45,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968199299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:45,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:45,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:28:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126353810] [2022-11-16 19:28:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:45,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:28:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:28:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:28:45,026 INFO L87 Difference]: Start difference. First operand 2346 states and 8732 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 19:28:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:45,842 INFO L93 Difference]: Finished difference Result 3726 states and 13476 transitions. [2022-11-16 19:28:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:28:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 19:28:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:45,871 INFO L225 Difference]: With dead ends: 3726 [2022-11-16 19:28:45,871 INFO L226 Difference]: Without dead ends: 3362 [2022-11-16 19:28:45,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 19:28:45,873 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 109 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:45,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 38 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 19:28:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2022-11-16 19:28:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 2478. [2022-11-16 19:28:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 3.714170367379895) internal successors, (9200), 2477 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states 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 19:28:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 9200 transitions. [2022-11-16 19:28:46,002 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 9200 transitions. Word has length 15 [2022-11-16 19:28:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:46,003 INFO L495 AbstractCegarLoop]: Abstraction has 2478 states and 9200 transitions. [2022-11-16 19:28:46,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 19:28:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 9200 transitions. [2022-11-16 19:28:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:28:46,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:46,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:46,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 19:28:46,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1682587028, now seen corresponding path program 2 times [2022-11-16 19:28:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550247897] [2022-11-16 19:28:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:46,913 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 19:28:46,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550247897] [2022-11-16 19:28:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550247897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:46,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:46,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:28:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734338453] [2022-11-16 19:28:46,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:46,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:28:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:46,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:28:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:28:46,916 INFO L87 Difference]: Start difference. First operand 2478 states and 9200 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 19:28:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:47,230 INFO L93 Difference]: Finished difference Result 2814 states and 10298 transitions. [2022-11-16 19:28:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:28:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 19:28:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:47,248 INFO L225 Difference]: With dead ends: 2814 [2022-11-16 19:28:47,249 INFO L226 Difference]: Without dead ends: 2534 [2022-11-16 19:28:47,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 19:28:47,250 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 78 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:47,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 38 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:28:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2022-11-16 19:28:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2342. [2022-11-16 19:28:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 2341 states have (on average 3.7249038872276805) internal successors, (8720), 2341 states have internal predecessors, (8720), 0 states have call successors, (0), 0 states 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 19:28:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 8720 transitions. [2022-11-16 19:28:47,346 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 8720 transitions. Word has length 15 [2022-11-16 19:28:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:47,347 INFO L495 AbstractCegarLoop]: Abstraction has 2342 states and 8720 transitions. [2022-11-16 19:28:47,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 19:28:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 8720 transitions. [2022-11-16 19:28:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 19:28:47,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:47,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:47,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 19:28:47,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -623276829, now seen corresponding path program 1 times [2022-11-16 19:28:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:47,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093055025] [2022-11-16 19:28:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:47,828 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 19:28:47,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:47,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093055025] [2022-11-16 19:28:47,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093055025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:47,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:47,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:28:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660611357] [2022-11-16 19:28:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:47,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:28:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:28:47,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:28:47,832 INFO L87 Difference]: Start difference. First operand 2342 states and 8720 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 19:28:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:48,095 INFO L93 Difference]: Finished difference Result 2590 states and 9502 transitions. [2022-11-16 19:28:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:28:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 19:28:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:48,110 INFO L225 Difference]: With dead ends: 2590 [2022-11-16 19:28:48,111 INFO L226 Difference]: Without dead ends: 2422 [2022-11-16 19:28:48,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:28:48,112 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:48,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 41 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:28:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-11-16 19:28:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2358. [2022-11-16 19:28:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 2357 states have (on average 3.7233771743742046) internal successors, (8776), 2357 states have internal predecessors, (8776), 0 states have call successors, (0), 0 states 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 19:28:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 8776 transitions. [2022-11-16 19:28:48,213 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 8776 transitions. Word has length 17 [2022-11-16 19:28:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:48,213 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 8776 transitions. [2022-11-16 19:28:48,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 19:28:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 8776 transitions. [2022-11-16 19:28:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 19:28:48,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:48,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:48,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 19:28:48,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1423038327, now seen corresponding path program 1 times [2022-11-16 19:28:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:48,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748609644] [2022-11-16 19:28:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:48,446 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 19:28:48,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:48,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748609644] [2022-11-16 19:28:48,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748609644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:48,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:48,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:28:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590473447] [2022-11-16 19:28:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:28:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:28:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:28:48,450 INFO L87 Difference]: Start difference. First operand 2358 states and 8776 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 19:28:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:48,542 INFO L93 Difference]: Finished difference Result 1779 states and 5957 transitions. [2022-11-16 19:28:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:28:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 19:28:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:48,552 INFO L225 Difference]: With dead ends: 1779 [2022-11-16 19:28:48,552 INFO L226 Difference]: Without dead ends: 1779 [2022-11-16 19:28:48,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:28:48,553 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:48,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:28:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-11-16 19:28:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2022-11-16 19:28:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1778 states have (on average 3.3503937007874014) internal successors, (5957), 1778 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states 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 19:28:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 5957 transitions. [2022-11-16 19:28:48,671 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 5957 transitions. Word has length 17 [2022-11-16 19:28:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:48,672 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 5957 transitions. [2022-11-16 19:28:48,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 19:28:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 5957 transitions. [2022-11-16 19:28:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 19:28:48,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:48,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:48,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 19:28:48,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash 583973784, now seen corresponding path program 1 times [2022-11-16 19:28:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:48,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475398735] [2022-11-16 19:28:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:48,919 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 19:28:48,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:48,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475398735] [2022-11-16 19:28:48,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475398735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:48,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:48,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:28:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069885194] [2022-11-16 19:28:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:48,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:28:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:28:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:28:48,923 INFO L87 Difference]: Start difference. First operand 1779 states and 5957 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 19:28:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:49,046 INFO L93 Difference]: Finished difference Result 1091 states and 3289 transitions. [2022-11-16 19:28:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:28:49,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 19:28:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:49,051 INFO L225 Difference]: With dead ends: 1091 [2022-11-16 19:28:49,051 INFO L226 Difference]: Without dead ends: 1091 [2022-11-16 19:28:49,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:28:49,052 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:49,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:28:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2022-11-16 19:28:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2022-11-16 19:28:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1090 states have (on average 3.0174311926605504) internal successors, (3289), 1090 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 19:28:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 3289 transitions. [2022-11-16 19:28:49,090 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 3289 transitions. Word has length 18 [2022-11-16 19:28:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:49,090 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 3289 transitions. [2022-11-16 19:28:49,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 19:28:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 3289 transitions. [2022-11-16 19:28:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:28:49,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:49,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:49,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 19:28:49,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1327541099, now seen corresponding path program 1 times [2022-11-16 19:28:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:49,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220905690] [2022-11-16 19:28:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:49,328 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 19:28:49,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220905690] [2022-11-16 19:28:49,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220905690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:49,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:49,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:28:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940421479] [2022-11-16 19:28:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:49,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:28:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:49,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:28:49,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:28:49,332 INFO L87 Difference]: Start difference. First operand 1091 states and 3289 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 19:28:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:49,569 INFO L93 Difference]: Finished difference Result 1510 states and 4423 transitions. [2022-11-16 19:28:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:28:49,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:28:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:49,575 INFO L225 Difference]: With dead ends: 1510 [2022-11-16 19:28:49,575 INFO L226 Difference]: Without dead ends: 1137 [2022-11-16 19:28:49,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:28:49,577 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:49,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:28:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-11-16 19:28:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1089. [2022-11-16 19:28:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 2.932904411764706) internal successors, (3191), 1088 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states 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 19:28:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 3191 transitions. [2022-11-16 19:28:49,624 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 3191 transitions. Word has length 20 [2022-11-16 19:28:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:49,625 INFO L495 AbstractCegarLoop]: Abstraction has 1089 states and 3191 transitions. [2022-11-16 19:28:49,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 19:28:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 3191 transitions. [2022-11-16 19:28:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:28:49,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:49,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:49,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 19:28:49,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash -300658136, now seen corresponding path program 1 times [2022-11-16 19:28:49,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:49,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086380229] [2022-11-16 19:28:49,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:49,915 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 19:28:49,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:49,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086380229] [2022-11-16 19:28:49,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086380229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:49,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:49,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:28:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264957673] [2022-11-16 19:28:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:49,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:28:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:28:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:28:49,918 INFO L87 Difference]: Start difference. First operand 1089 states and 3191 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 19:28:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:50,064 INFO L93 Difference]: Finished difference Result 790 states and 2337 transitions. [2022-11-16 19:28:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:28:50,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:28:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:50,068 INFO L225 Difference]: With dead ends: 790 [2022-11-16 19:28:50,068 INFO L226 Difference]: Without dead ends: 790 [2022-11-16 19:28:50,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:28:50,069 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:50,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 16 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:28:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-11-16 19:28:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 742. [2022-11-16 19:28:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.9433198380566803) internal successors, (2181), 741 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states 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 19:28:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2181 transitions. [2022-11-16 19:28:50,094 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2181 transitions. Word has length 20 [2022-11-16 19:28:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:50,094 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 2181 transitions. [2022-11-16 19:28:50,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 19:28:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2181 transitions. [2022-11-16 19:28:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 19:28:50,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:50,097 INFO L195 NwaCegarLoop]: 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] [2022-11-16 19:28:50,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 19:28:50,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash -432282589, now seen corresponding path program 1 times [2022-11-16 19:28:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:50,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480833126] [2022-11-16 19:28:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:50,292 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 19:28:50,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:50,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480833126] [2022-11-16 19:28:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480833126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:50,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:50,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:28:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623676887] [2022-11-16 19:28:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:50,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:28:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:28:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:28:50,295 INFO L87 Difference]: Start difference. First operand 742 states and 2181 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 19:28:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:50,450 INFO L93 Difference]: Finished difference Result 1037 states and 2932 transitions. [2022-11-16 19:28:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:28:50,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 19:28:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:50,453 INFO L225 Difference]: With dead ends: 1037 [2022-11-16 19:28:50,453 INFO L226 Difference]: Without dead ends: 663 [2022-11-16 19:28:50,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:28:50,454 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:50,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 19 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:28:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-11-16 19:28:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 659. [2022-11-16 19:28:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 2.6778115501519757) internal successors, (1762), 658 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states 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 19:28:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1762 transitions. [2022-11-16 19:28:50,474 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1762 transitions. Word has length 23 [2022-11-16 19:28:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:50,475 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 1762 transitions. [2022-11-16 19:28:50,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 19:28:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1762 transitions. [2022-11-16 19:28:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 19:28:50,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:50,478 INFO L195 NwaCegarLoop]: 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] [2022-11-16 19:28:50,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 19:28:50,478 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1585841767, now seen corresponding path program 2 times [2022-11-16 19:28:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:50,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359678032] [2022-11-16 19:28:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:50,736 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 19:28:50,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:50,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359678032] [2022-11-16 19:28:50,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359678032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:50,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:50,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:28:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107753925] [2022-11-16 19:28:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:50,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:28:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:28:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:28:50,739 INFO L87 Difference]: Start difference. First operand 659 states and 1762 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 19:28:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:50,886 INFO L93 Difference]: Finished difference Result 605 states and 1658 transitions. [2022-11-16 19:28:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:28:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 19:28:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:50,888 INFO L225 Difference]: With dead ends: 605 [2022-11-16 19:28:50,888 INFO L226 Difference]: Without dead ends: 185 [2022-11-16 19:28:50,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:28:50,889 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 111 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:50,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 14 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:28:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-16 19:28:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-16 19:28:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.472826086956522) internal successors, (455), 184 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 19:28:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2022-11-16 19:28:50,895 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 23 [2022-11-16 19:28:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:50,895 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2022-11-16 19:28:50,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 19:28:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2022-11-16 19:28:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:28:50,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:50,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:50,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 19:28:50,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1427139121, now seen corresponding path program 1 times [2022-11-16 19:28:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:50,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986935942] [2022-11-16 19:28:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:51,932 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 19:28:51,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:51,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986935942] [2022-11-16 19:28:51,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986935942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:51,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:51,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:28:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307519836] [2022-11-16 19:28:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:51,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:28:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:51,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:28:51,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:28:51,934 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 19:28:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:52,343 INFO L93 Difference]: Finished difference Result 260 states and 642 transitions. [2022-11-16 19:28:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:28:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 19:28:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:52,345 INFO L225 Difference]: With dead ends: 260 [2022-11-16 19:28:52,345 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:28:52,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 19:28:52,346 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:52,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 21 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:28:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:28:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 19:28:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 92 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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 19:28:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2022-11-16 19:28:52,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2022-11-16 19:28:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:52,350 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2022-11-16 19:28:52,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 19:28:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2022-11-16 19:28:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:28:52,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:52,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:52,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 19:28:52,352 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash 646588623, now seen corresponding path program 2 times [2022-11-16 19:28:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185644151] [2022-11-16 19:28:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:28:53,628 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 19:28:53,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:28:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185644151] [2022-11-16 19:28:53,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185644151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:28:53,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:28:53,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:28:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837685706] [2022-11-16 19:28:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:28:53,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 19:28:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:28:53,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 19:28:53,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 19:28:53,630 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 19:28:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:28:53,956 INFO L93 Difference]: Finished difference Result 140 states and 290 transitions. [2022-11-16 19:28:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:28:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 19:28:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:28:53,958 INFO L225 Difference]: With dead ends: 140 [2022-11-16 19:28:53,958 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 19:28:53,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-16 19:28:53,959 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:28:53,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 33 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:28:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 19:28:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2022-11-16 19:28:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.921875) internal successors, (123), 64 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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 19:28:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2022-11-16 19:28:53,962 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2022-11-16 19:28:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:28:53,962 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2022-11-16 19:28:53,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 19:28:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2022-11-16 19:28:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 19:28:53,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:28:53,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:53,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 19:28:53,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 19:28:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:28:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1363269081, now seen corresponding path program 3 times [2022-11-16 19:28:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:28:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092826162] [2022-11-16 19:28:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:28:53,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:28:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:28:54,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 19:28:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 19:28:54,119 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 19:28:54,120 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 19:28:54,121 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-16 19:28:54,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-16 19:28:54,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-16 19:28:54,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-16 19:28:54,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-16 19:28:54,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-16 19:28:54,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-16 19:28:54,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 19:28:54,130 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:28:54,138 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 19:28:54,139 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 19:28:54,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:28:54 BasicIcfg [2022-11-16 19:28:54,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 19:28:54,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 19:28:54,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 19:28:54,284 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 19:28:54,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:28:29" (3/4) ... [2022-11-16 19:28:54,287 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 19:28:54,448 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 19:28:54,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 19:28:54,449 INFO L158 Benchmark]: Toolchain (without parser) took 26504.60ms. Allocated memory was 119.5MB in the beginning and 390.1MB in the end (delta: 270.5MB). Free memory was 76.2MB in the beginning and 119.9MB in the end (delta: -43.7MB). Peak memory consumption was 226.5MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,450 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 19:28:54,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 851.22ms. Allocated memory is still 119.5MB. Free memory was 76.1MB in the beginning and 82.0MB in the end (delta: -5.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.36ms. Allocated memory is still 119.5MB. Free memory was 82.0MB in the beginning and 79.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,452 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 119.5MB. Free memory was 78.9MB in the beginning and 77.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,453 INFO L158 Benchmark]: RCFGBuilder took 1004.53ms. Allocated memory is still 119.5MB. Free memory was 77.3MB in the beginning and 89.9MB in the end (delta: -12.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,453 INFO L158 Benchmark]: TraceAbstraction took 24372.37ms. Allocated memory was 119.5MB in the beginning and 390.1MB in the end (delta: 270.5MB). Free memory was 89.2MB in the beginning and 135.7MB in the end (delta: -46.4MB). Peak memory consumption was 224.3MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,454 INFO L158 Benchmark]: Witness Printer took 165.41ms. Allocated memory is still 390.1MB. Free memory was 135.7MB in the beginning and 119.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 19:28:54,461 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.33ms. Allocated memory is still 119.5MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 851.22ms. Allocated memory is still 119.5MB. Free memory was 76.1MB in the beginning and 82.0MB in the end (delta: -5.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.36ms. Allocated memory is still 119.5MB. Free memory was 82.0MB in the beginning and 79.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 119.5MB. Free memory was 78.9MB in the beginning and 77.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.53ms. Allocated memory is still 119.5MB. Free memory was 77.3MB in the beginning and 89.9MB in the end (delta: -12.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24372.37ms. Allocated memory was 119.5MB in the beginning and 390.1MB in the end (delta: 270.5MB). Free memory was 89.2MB in the beginning and 135.7MB in the end (delta: -46.4MB). Peak memory consumption was 224.3MB. Max. memory is 16.1GB. * Witness Printer took 165.41ms. Allocated memory is still 390.1MB. Free memory was 135.7MB in the beginning and 119.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 148 PlacesBefore, 46 PlacesAfterwards, 137 TransitionsBefore, 34 TransitionsAfterwards, 3168 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4269, independent: 4072, independent conditional: 0, independent unconditional: 4072, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2324, independent: 2274, independent conditional: 0, independent unconditional: 2274, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2324, independent: 2240, independent conditional: 0, independent unconditional: 2240, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 422, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4269, independent: 1798, independent conditional: 0, independent unconditional: 1798, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 2324, unknown conditional: 0, unknown unconditional: 2324] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L740] 0 _Bool z$r_buff1_thd4; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L747] 0 _Bool weak$$choice0; [L745] 0 int z$w_buff1; [L748] 0 _Bool weak$$choice2; [L729] 0 _Bool z$flush_delayed; [L743] 0 int z$w_buff0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool z$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EBX = 0; [L734] 0 _Bool z$r_buff0_thd3; [L730] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd4; [L741] 0 _Bool z$read_delayed; [L718] 0 int a = 0; [L720] 0 int b = 0; [L742] 0 int *z$read_delayed_var; [L746] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L721] 0 _Bool main$tmp_guard0; [L744] 0 _Bool z$w_buff0_used; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 770 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 770 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1775 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 109 mSDtfsCounter, 1775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3162occurred in iteration=0, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 2812 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 19:28:54,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_994a8947-1a2e-4784-b259-64dcf4c708b1/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE