./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI --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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- 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-5e519f3 [2022-11-03 02:38:34,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:38:34,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:38:34,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:38:34,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:38:34,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:38:34,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:38:34,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:38:34,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:38:34,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:38:34,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:38:34,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:38:34,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:38:34,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:38:34,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:38:34,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:38:34,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:38:34,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:38:34,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:38:34,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:38:34,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:38:34,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:38:34,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:38:34,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:38:34,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:38:34,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:38:34,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:38:34,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:38:34,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:38:34,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:38:34,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:38:34,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:38:34,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:38:34,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:38:34,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:38:34,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:38:34,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:38:34,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:38:34,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:38:34,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:38:34,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:38:34,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:38:34,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:38:34,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:38:34,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:38:34,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:38:34,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:38:34,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:38:34,644 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:38:34,644 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:38:34,644 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:38:34,644 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:38:34,645 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:38:34,645 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:38:34,645 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:38:34,645 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:38:34,646 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:38:34,646 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:38:34,646 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:38:34,646 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:38:34,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:38:34,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:38:34,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:38:34,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:38:34,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:38:34,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:38:34,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:38:34,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:38:34,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:38:34,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:38:34,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:38:34,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:38:34,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:38:34,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:38:34,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:38:34,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:38:34,651 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:38:34,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:38:34,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:38:34,652 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:38:34,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:38:34,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:38:34,653 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:38:34,653 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_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/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_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI 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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2022-11-03 02:38:34,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:38:35,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:38:35,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:38:35,034 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:38:35,035 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:38:35,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 02:38:35,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/data/6b6d2f508/40ad2de5315148469c35124a8b3dfc59/FLAGa9fbf5921 [2022-11-03 02:38:35,663 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:38:35,664 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 02:38:35,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/data/6b6d2f508/40ad2de5315148469c35124a8b3dfc59/FLAGa9fbf5921 [2022-11-03 02:38:35,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/data/6b6d2f508/40ad2de5315148469c35124a8b3dfc59 [2022-11-03 02:38:35,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:38:35,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:38:35,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:38:35,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:38:35,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:38:35,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:38:35" (1/1) ... [2022-11-03 02:38:35,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511af8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:35, skipping insertion in model container [2022-11-03 02:38:35,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:38:35" (1/1) ... [2022-11-03 02:38:35,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:38:36,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:38:36,246 WARN L230 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_907f7d01-1ba0-445f-b77e-08b8384cf441/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 02:38:36,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:38:36,552 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:38:36,567 WARN L230 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_907f7d01-1ba0-445f-b77e-08b8384cf441/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 02:38:36,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:38:36,693 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:38:36,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36 WrapperNode [2022-11-03 02:38:36,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:38:36,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:38:36,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:38:36,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:38:36,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,752 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-11-03 02:38:36,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:38:36,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:38:36,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:38:36,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:38:36,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,805 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:38:36,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:38:36,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:38:36,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:38:36,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (1/1) ... [2022-11-03 02:38:36,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:38:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:38:36,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:38:36,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:38:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:38:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:38:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:38:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:38:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:38:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 02:38:36,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 02:38:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 02:38:36,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 02:38:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-03 02:38:36,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-03 02:38:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-03 02:38:36,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-03 02:38:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:38:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:38:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:38:36,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:38:36,921 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:38:37,247 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:38:37,249 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:38:38,180 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:38:38,648 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:38:38,649 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:38:38,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:38:38 BoogieIcfgContainer [2022-11-03 02:38:38,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:38:38,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:38:38,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:38:38,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:38:38,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:38:35" (1/3) ... [2022-11-03 02:38:38,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607997f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:38:38, skipping insertion in model container [2022-11-03 02:38:38,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:38:36" (2/3) ... [2022-11-03 02:38:38,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607997f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:38:38, skipping insertion in model container [2022-11-03 02:38:38,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:38:38" (3/3) ... [2022-11-03 02:38:38,667 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 02:38:38,681 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:38:38,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:38:38,693 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:38:38,694 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:38:38,834 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:38:38,914 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:38:38,936 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 298 flow [2022-11-03 02:38:38,942 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 298 flow [2022-11-03 02:38:38,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-11-03 02:38:39,039 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-03 02:38:39,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:38:39,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-03 02:38:39,050 INFO L118 LiptonReduction]: Number of co-enabled transitions 3548 [2022-11-03 02:38:46,859 INFO L133 LiptonReduction]: Checked pairs total: 10381 [2022-11-03 02:38:46,859 INFO L135 LiptonReduction]: Total number of compositions: 118 [2022-11-03 02:38:46,868 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2022-11-03 02:38:47,306 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6206 states, 6203 states have (on average 4.209576011607287) internal successors, (26112), 6205 states have internal predecessors, (26112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:47,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:38:47,340 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;@b648801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:38:47,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 02:38:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 6206 states, 6203 states have (on average 4.209576011607287) internal successors, (26112), 6205 states have internal predecessors, (26112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:38:47,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:47,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:38:47,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1284179, now seen corresponding path program 1 times [2022-11-03 02:38:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:47,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565176017] [2022-11-03 02:38:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:47,900 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-03 02:38:47,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:47,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565176017] [2022-11-03 02:38:47,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565176017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:47,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:47,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:38:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346935045] [2022-11-03 02:38:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:47,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:38:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:38:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:38:47,962 INFO L87 Difference]: Start difference. First operand has 6206 states, 6203 states have (on average 4.209576011607287) internal successors, (26112), 6205 states have internal predecessors, (26112), 0 states have call successors, (0), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:48,267 INFO L93 Difference]: Finished difference Result 5052 states and 20132 transitions. [2022-11-03 02:38:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:38:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-03 02:38:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:48,355 INFO L225 Difference]: With dead ends: 5052 [2022-11-03 02:38:48,356 INFO L226 Difference]: Without dead ends: 4872 [2022-11-03 02:38:48,357 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-03 02:38:48,362 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:48,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:38:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2022-11-03 02:38:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4872. [2022-11-03 02:38:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4871 states have (on average 4.004927119687949) internal successors, (19508), 4871 states have internal predecessors, (19508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 19508 transitions. [2022-11-03 02:38:48,720 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 19508 transitions. Word has length 3 [2022-11-03 02:38:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:48,721 INFO L495 AbstractCegarLoop]: Abstraction has 4872 states and 19508 transitions. [2022-11-03 02:38:48,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 19508 transitions. [2022-11-03 02:38:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:38:48,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:48,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:48,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:38:48,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2007894270, now seen corresponding path program 1 times [2022-11-03 02:38:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:48,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981967684] [2022-11-03 02:38:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:49,126 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-03 02:38:49,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:49,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981967684] [2022-11-03 02:38:49,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981967684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:49,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:49,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:38:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100692717] [2022-11-03 02:38:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:38:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:38:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:38:49,131 INFO L87 Difference]: Start difference. First operand 4872 states and 19508 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-03 02:38:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:49,606 INFO L93 Difference]: Finished difference Result 10372 states and 39983 transitions. [2022-11-03 02:38:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:38:49,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-03 02:38:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:49,680 INFO L225 Difference]: With dead ends: 10372 [2022-11-03 02:38:49,680 INFO L226 Difference]: Without dead ends: 8170 [2022-11-03 02:38:49,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-03 02:38:49,682 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:49,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:38:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2022-11-03 02:38:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 6700. [2022-11-03 02:38:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 3.920883713987162) internal successors, (26266), 6699 states have internal predecessors, (26266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 26266 transitions. [2022-11-03 02:38:50,218 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 26266 transitions. Word has length 12 [2022-11-03 02:38:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:50,219 INFO L495 AbstractCegarLoop]: Abstraction has 6700 states and 26266 transitions. [2022-11-03 02:38:50,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-03 02:38:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 26266 transitions. [2022-11-03 02:38:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:38:50,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:50,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:50,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:38:50,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1252110434, now seen corresponding path program 1 times [2022-11-03 02:38:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:50,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175103490] [2022-11-03 02:38:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:50,532 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-03 02:38:50,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175103490] [2022-11-03 02:38:50,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175103490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:50,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:50,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:38:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957357229] [2022-11-03 02:38:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:38:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:38:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:38:50,539 INFO L87 Difference]: Start difference. First operand 6700 states and 26266 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-03 02:38:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:51,039 INFO L93 Difference]: Finished difference Result 8537 states and 32163 transitions. [2022-11-03 02:38:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:38:51,040 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-03 02:38:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:51,107 INFO L225 Difference]: With dead ends: 8537 [2022-11-03 02:38:51,107 INFO L226 Difference]: Without dead ends: 7158 [2022-11-03 02:38:51,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:38:51,110 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:51,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 29 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:38:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2022-11-03 02:38:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 5217. [2022-11-03 02:38:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5217 states, 5216 states have (on average 3.889187116564417) internal successors, (20286), 5216 states have internal predecessors, (20286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 20286 transitions. [2022-11-03 02:38:51,440 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 20286 transitions. Word has length 13 [2022-11-03 02:38:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:51,441 INFO L495 AbstractCegarLoop]: Abstraction has 5217 states and 20286 transitions. [2022-11-03 02:38:51,441 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-03 02:38:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 20286 transitions. [2022-11-03 02:38:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:38:51,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:51,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:51,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:38:51,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:51,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1112169337, now seen corresponding path program 1 times [2022-11-03 02:38:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686142262] [2022-11-03 02:38:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:51,793 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-03 02:38:51,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:51,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686142262] [2022-11-03 02:38:51,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686142262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:51,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:51,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:38:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612734464] [2022-11-03 02:38:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:51,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:38:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:38:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:38:51,796 INFO L87 Difference]: Start difference. First operand 5217 states and 20286 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:52,326 INFO L93 Difference]: Finished difference Result 8029 states and 30036 transitions. [2022-11-03 02:38:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:38:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-03 02:38:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:52,377 INFO L225 Difference]: With dead ends: 8029 [2022-11-03 02:38:52,377 INFO L226 Difference]: Without dead ends: 6964 [2022-11-03 02:38:52,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:38:52,381 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 78 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:52,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 21 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:38:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6964 states. [2022-11-03 02:38:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6964 to 5065. [2022-11-03 02:38:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5065 states, 5064 states have (on average 3.875987361769352) internal successors, (19628), 5064 states have internal predecessors, (19628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 19628 transitions. [2022-11-03 02:38:52,850 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 19628 transitions. Word has length 14 [2022-11-03 02:38:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:52,851 INFO L495 AbstractCegarLoop]: Abstraction has 5065 states and 19628 transitions. [2022-11-03 02:38:52,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 19628 transitions. [2022-11-03 02:38:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:38:52,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:52,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:52,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:38:52,856 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash -721192423, now seen corresponding path program 1 times [2022-11-03 02:38:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:52,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390612397] [2022-11-03 02:38:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:53,081 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-03 02:38:53,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:53,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390612397] [2022-11-03 02:38:53,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390612397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:53,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:53,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:38:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385341798] [2022-11-03 02:38:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:53,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:38:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:38:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:38:53,085 INFO L87 Difference]: Start difference. First operand 5065 states and 19628 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-03 02:38:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:53,309 INFO L93 Difference]: Finished difference Result 5305 states and 20180 transitions. [2022-11-03 02:38:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:38:53,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-03 02:38:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:53,338 INFO L225 Difference]: With dead ends: 5305 [2022-11-03 02:38:53,338 INFO L226 Difference]: Without dead ends: 4745 [2022-11-03 02:38:53,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-03 02:38:53,339 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:53,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 21 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:38:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4745 states. [2022-11-03 02:38:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4745 to 4313. [2022-11-03 02:38:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 4312 states have (on average 3.8404452690166977) internal successors, (16560), 4312 states have internal predecessors, (16560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 16560 transitions. [2022-11-03 02:38:53,530 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 16560 transitions. Word has length 15 [2022-11-03 02:38:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:53,530 INFO L495 AbstractCegarLoop]: Abstraction has 4313 states and 16560 transitions. [2022-11-03 02:38:53,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-03 02:38:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 16560 transitions. [2022-11-03 02:38:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:38:53,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:53,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:53,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:38:53,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash -182046214, now seen corresponding path program 1 times [2022-11-03 02:38:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:53,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385533121] [2022-11-03 02:38:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:38:53,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:53,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385533121] [2022-11-03 02:38:53,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385533121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:53,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:53,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:38:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776887918] [2022-11-03 02:38:53,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:38:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:38:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:38:53,750 INFO L87 Difference]: Start difference. First operand 4313 states and 16560 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:53,858 INFO L93 Difference]: Finished difference Result 3105 states and 10584 transitions. [2022-11-03 02:38:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:38:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-03 02:38:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:53,873 INFO L225 Difference]: With dead ends: 3105 [2022-11-03 02:38:53,873 INFO L226 Difference]: Without dead ends: 3105 [2022-11-03 02:38:53,874 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-03 02:38:53,875 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:53,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:38:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2022-11-03 02:38:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 3105. [2022-11-03 02:38:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 3.4097938144329896) internal successors, (10584), 3104 states have internal predecessors, (10584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 10584 transitions. [2022-11-03 02:38:53,977 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 10584 transitions. Word has length 16 [2022-11-03 02:38:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:53,978 INFO L495 AbstractCegarLoop]: Abstraction has 3105 states and 10584 transitions. [2022-11-03 02:38:53,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 10584 transitions. [2022-11-03 02:38:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:38:53,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:53,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:53,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:38:53,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -931446910, now seen corresponding path program 1 times [2022-11-03 02:38:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:53,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805987859] [2022-11-03 02:38:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:38:54,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:54,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805987859] [2022-11-03 02:38:54,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805987859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:54,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:54,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:38:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170357975] [2022-11-03 02:38:54,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:54,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:38:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:38:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:38:54,170 INFO L87 Difference]: Start difference. First operand 3105 states and 10584 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:54,381 INFO L93 Difference]: Finished difference Result 1921 states and 5928 transitions. [2022-11-03 02:38:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:38:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-03 02:38:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:54,391 INFO L225 Difference]: With dead ends: 1921 [2022-11-03 02:38:54,391 INFO L226 Difference]: Without dead ends: 1921 [2022-11-03 02:38:54,392 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-03 02:38:54,393 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 47 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:54,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 15 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:38:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-11-03 02:38:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1909. [2022-11-03 02:38:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1908 states have (on average 3.0838574423480085) internal successors, (5884), 1908 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 5884 transitions. [2022-11-03 02:38:54,481 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 5884 transitions. Word has length 19 [2022-11-03 02:38:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:54,481 INFO L495 AbstractCegarLoop]: Abstraction has 1909 states and 5884 transitions. [2022-11-03 02:38:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 5884 transitions. [2022-11-03 02:38:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:38:54,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:54,491 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] [2022-11-03 02:38:54,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:38:54,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1139185664, now seen corresponding path program 1 times [2022-11-03 02:38:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:54,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530326567] [2022-11-03 02:38:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:54,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:54,983 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-03 02:38:54,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:54,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530326567] [2022-11-03 02:38:54,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530326567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:54,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:54,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:38:54,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204296439] [2022-11-03 02:38:54,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:54,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:38:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:54,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:38:54,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:38:54,987 INFO L87 Difference]: Start difference. First operand 1909 states and 5884 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:55,213 INFO L93 Difference]: Finished difference Result 1479 states and 4626 transitions. [2022-11-03 02:38:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:38:55,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-03 02:38:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:55,220 INFO L225 Difference]: With dead ends: 1479 [2022-11-03 02:38:55,221 INFO L226 Difference]: Without dead ends: 1443 [2022-11-03 02:38:55,221 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-03 02:38:55,222 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:55,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 20 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:38:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-11-03 02:38:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1362. [2022-11-03 02:38:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 3.121234386480529) internal successors, (4248), 1361 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 4248 transitions. [2022-11-03 02:38:55,284 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 4248 transitions. Word has length 22 [2022-11-03 02:38:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:55,284 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 4248 transitions. [2022-11-03 02:38:55,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 4248 transitions. [2022-11-03 02:38:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:38:55,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:55,291 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] [2022-11-03 02:38:55,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:38:55,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1433894432, now seen corresponding path program 1 times [2022-11-03 02:38:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:55,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979702013] [2022-11-03 02:38:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:55,812 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-03 02:38:55,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:55,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979702013] [2022-11-03 02:38:55,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979702013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:55,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:55,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:38:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105123575] [2022-11-03 02:38:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:55,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:38:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:38:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:38:55,815 INFO L87 Difference]: Start difference. First operand 1362 states and 4248 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:56,101 INFO L93 Difference]: Finished difference Result 2554 states and 7910 transitions. [2022-11-03 02:38:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:38:56,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-03 02:38:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:56,108 INFO L225 Difference]: With dead ends: 2554 [2022-11-03 02:38:56,108 INFO L226 Difference]: Without dead ends: 1821 [2022-11-03 02:38:56,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:56,109 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:56,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 22 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:38:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-11-03 02:38:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1362. [2022-11-03 02:38:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 3.0) internal successors, (4083), 1361 states have internal predecessors, (4083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 4083 transitions. [2022-11-03 02:38:56,153 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 4083 transitions. Word has length 26 [2022-11-03 02:38:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:56,153 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 4083 transitions. [2022-11-03 02:38:56,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 4083 transitions. [2022-11-03 02:38:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:38:56,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:56,157 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] [2022-11-03 02:38:56,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:38:56,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1243379751, now seen corresponding path program 1 times [2022-11-03 02:38:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:56,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339966373] [2022-11-03 02:38:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:56,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:56,494 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-03 02:38:56,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:56,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339966373] [2022-11-03 02:38:56,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339966373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:56,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:56,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:38:56,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951504895] [2022-11-03 02:38:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:56,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:38:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:38:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:38:56,497 INFO L87 Difference]: Start difference. First operand 1362 states and 4083 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:56,737 INFO L93 Difference]: Finished difference Result 1946 states and 5751 transitions. [2022-11-03 02:38:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:38:56,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-03 02:38:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:56,742 INFO L225 Difference]: With dead ends: 1946 [2022-11-03 02:38:56,742 INFO L226 Difference]: Without dead ends: 1329 [2022-11-03 02:38:56,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:56,743 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:56,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 19 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:38:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-11-03 02:38:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1240. [2022-11-03 02:38:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1239 states have (on average 2.9184826472962064) internal successors, (3616), 1239 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 3616 transitions. [2022-11-03 02:38:56,782 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 3616 transitions. Word has length 26 [2022-11-03 02:38:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:56,782 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 3616 transitions. [2022-11-03 02:38:56,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 3616 transitions. [2022-11-03 02:38:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:38:56,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:56,787 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] [2022-11-03 02:38:56,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:38:56,787 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash -305653913, now seen corresponding path program 2 times [2022-11-03 02:38:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:56,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998837671] [2022-11-03 02:38:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:57,136 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-03 02:38:57,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:57,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998837671] [2022-11-03 02:38:57,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998837671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:57,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:57,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:38:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679704319] [2022-11-03 02:38:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:57,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:38:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:57,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:38:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:57,139 INFO L87 Difference]: Start difference. First operand 1240 states and 3616 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:57,357 INFO L93 Difference]: Finished difference Result 1176 states and 3492 transitions. [2022-11-03 02:38:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:38:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-03 02:38:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:57,360 INFO L225 Difference]: With dead ends: 1176 [2022-11-03 02:38:57,360 INFO L226 Difference]: Without dead ends: 656 [2022-11-03 02:38:57,361 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-03 02:38:57,361 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 128 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:57,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 18 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:38:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-03 02:38:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-11-03 02:38:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 2.949618320610687) internal successors, (1932), 655 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1932 transitions. [2022-11-03 02:38:57,386 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1932 transitions. Word has length 26 [2022-11-03 02:38:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:57,386 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1932 transitions. [2022-11-03 02:38:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1932 transitions. [2022-11-03 02:38:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:38:57,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:57,393 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, 1, 1, 1] [2022-11-03 02:38:57,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:38:57,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 537069599, now seen corresponding path program 1 times [2022-11-03 02:38:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:57,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000700505] [2022-11-03 02:38:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:59,301 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-03 02:38:59,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:59,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000700505] [2022-11-03 02:38:59,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000700505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:59,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:59,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:38:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703340502] [2022-11-03 02:38:59,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:59,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:38:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:59,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:38:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:38:59,303 INFO L87 Difference]: Start difference. First operand 656 states and 1932 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:59,819 INFO L93 Difference]: Finished difference Result 1043 states and 2977 transitions. [2022-11-03 02:38:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:38:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:38:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:59,823 INFO L225 Difference]: With dead ends: 1043 [2022-11-03 02:38:59,823 INFO L226 Difference]: Without dead ends: 828 [2022-11-03 02:38:59,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:38:59,824 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 105 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:59,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 55 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:38:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-03 02:38:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 656. [2022-11-03 02:38:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 2.8427480916030534) internal successors, (1862), 655 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1862 transitions. [2022-11-03 02:38:59,844 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1862 transitions. Word has length 30 [2022-11-03 02:38:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:59,844 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1862 transitions. [2022-11-03 02:38:59,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:38:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1862 transitions. [2022-11-03 02:38:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:38:59,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:59,847 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, 1, 1, 1] [2022-11-03 02:38:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:38:59,847 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:38:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1523628545, now seen corresponding path program 2 times [2022-11-03 02:38:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430753306] [2022-11-03 02:38:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:38:59,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:39:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:39:00,040 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:39:00,040 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:39:00,041 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-03 02:39:00,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-03 02:39:00,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-03 02:39:00,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-03 02:39:00,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-03 02:39:00,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-03 02:39:00,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-03 02:39:00,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:39:00,048 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:39:00,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 02:39:00,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:39:00,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:39:00 BasicIcfg [2022-11-03 02:39:00,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:39:00,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:39:00,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:39:00,168 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:39:00,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:38:38" (3/4) ... [2022-11-03 02:39:00,170 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:39:00,311 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:39:00,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:39:00,313 INFO L158 Benchmark]: Toolchain (without parser) took 24357.76ms. Allocated memory was 92.3MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 56.3MB in the beginning and 685.3MB in the end (delta: -629.0MB). Peak memory consumption was 281.1MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,313 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 92.3MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:39:00,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.97ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 56.1MB in the beginning and 74.2MB in the end (delta: -18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.38ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 71.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,318 INFO L158 Benchmark]: Boogie Preprocessor took 59.98ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 69.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,318 INFO L158 Benchmark]: RCFGBuilder took 1837.36ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 69.0MB in the beginning and 103.2MB in the end (delta: -34.2MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,319 INFO L158 Benchmark]: TraceAbstraction took 21511.49ms. Allocated memory was 136.3MB in the beginning and 1.0GB in the end (delta: 866.1MB). Free memory was 102.2MB in the beginning and 710.5MB in the end (delta: -608.3MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,319 INFO L158 Benchmark]: Witness Printer took 144.57ms. Allocated memory is still 1.0GB. Free memory was 710.5MB in the beginning and 685.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-03 02:39:00,323 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 92.3MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.97ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 56.1MB in the beginning and 74.2MB in the end (delta: -18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.38ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 71.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.98ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 69.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1837.36ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 69.0MB in the beginning and 103.2MB in the end (delta: -34.2MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21511.49ms. Allocated memory was 136.3MB in the beginning and 1.0GB in the end (delta: 866.1MB). Free memory was 102.2MB in the beginning and 710.5MB in the end (delta: -608.3MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. * Witness Printer took 144.57ms. Allocated memory is still 1.0GB. Free memory was 710.5MB in the beginning and 685.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 150 PlacesBefore, 49 PlacesAfterwards, 139 TransitionsBefore, 37 TransitionsAfterwards, 3548 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 10381 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4879, positive: 4634, positive conditional: 0, positive unconditional: 4634, negative: 245, negative conditional: 0, negative unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2547, positive: 2477, positive conditional: 0, positive unconditional: 2477, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2547, positive: 2441, positive conditional: 0, positive unconditional: 2441, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 106, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 777, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 677, negative conditional: 0, negative unconditional: 677, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4879, positive: 2157, positive conditional: 0, positive unconditional: 2157, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 2547, unknown conditional: 0, unknown unconditional: 2547] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-2, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-1, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=1, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L805] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L825] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 701 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 701 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 900 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1463 IncrementalHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 100 mSDtfsCounter, 1463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6700occurred in iteration=2, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 6555 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-03 02:39:00,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907f7d01-1ba0-445f-b77e-08b8384cf441/bin/utaipan-7li7fVZpFI/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