./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW --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 4fc83f7400faec1e297c0070148ef6e08fc24a46b81d9a9e52a0ee501a0da326 --- 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-4e7fbc6 [2022-11-23 14:48:04,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:48:04,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:48:04,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:48:04,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:48:04,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:48:04,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:48:04,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:48:04,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:48:04,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:48:04,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:48:04,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:48:04,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:48:04,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:48:04,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:48:04,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:48:04,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:48:04,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:48:04,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:48:04,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:48:04,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:48:04,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:48:04,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:48:04,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:48:04,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:48:04,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:48:04,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:48:04,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:48:04,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:48:04,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:48:04,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:48:04,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:48:04,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:48:04,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:48:04,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:48:04,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:48:04,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:48:04,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:48:04,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:48:04,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:48:04,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:48:04,938 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:48:04,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:48:04,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:48:04,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:48:04,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:48:04,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:48:04,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:48:04,980 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:48:04,980 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:48:04,980 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:48:04,980 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:48:04,981 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:48:04,981 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:48:04,982 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:48:04,982 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:48:04,982 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:48:04,982 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:48:04,983 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:48:04,983 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:48:04,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:48:04,984 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:48:04,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:48:04,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:48:04,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:48:04,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:48:04,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:48:04,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:48:04,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:48:04,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:48:04,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:48:04,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:48:04,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:48:04,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:48:04,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:48:04,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:48:04,987 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:48:04,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:48:04,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:48:04,988 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:48:04,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:48:04,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:48:04,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:48:04,989 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_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/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_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW 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 -> 4fc83f7400faec1e297c0070148ef6e08fc24a46b81d9a9e52a0ee501a0da326 [2022-11-23 14:48:05,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:48:05,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:48:05,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:48:05,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:48:05,288 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:48:05,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i [2022-11-23 14:48:08,409 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:48:08,737 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:48:08,737 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i [2022-11-23 14:48:08,753 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/data/071eb735f/5e04ff5a1f794572b82ff52406a3d333/FLAG2550bd20a [2022-11-23 14:48:08,772 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/data/071eb735f/5e04ff5a1f794572b82ff52406a3d333 [2022-11-23 14:48:08,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:48:08,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:48:08,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:48:08,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:48:08,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:48:08,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:48:08" (1/1) ... [2022-11-23 14:48:08,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65eed81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:08, skipping insertion in model container [2022-11-23 14:48:08,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:48:08" (1/1) ... [2022-11-23 14:48:08,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:48:08,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:48:09,037 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i[949,962] [2022-11-23 14:48:09,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:48:09,423 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:48:09,436 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i[949,962] [2022-11-23 14:48:09,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:48:09,542 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:48:09,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09 WrapperNode [2022-11-23 14:48:09,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:48:09,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:48:09,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:48:09,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:48:09,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,650 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 257 [2022-11-23 14:48:09,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:48:09,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:48:09,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:48:09,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:48:09,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,702 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:48:09,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:48:09,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:48:09,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:48:09,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (1/1) ... [2022-11-23 14:48:09,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:48:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:48:09,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:48:09,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:48:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:48:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 14:48:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:48:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:48:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:48:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 14:48:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 14:48:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 14:48:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 14:48:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 14:48:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 14:48:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 14:48:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 14:48:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:48:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 14:48:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:48:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:48:09,816 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 14:48:10,070 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:48:10,074 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:48:10,637 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:48:10,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:48:10,837 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 14:48:10,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:48:10 BoogieIcfgContainer [2022-11-23 14:48:10,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:48:10,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:48:10,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:48:10,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:48:10,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:48:08" (1/3) ... [2022-11-23 14:48:10,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f6d3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:48:10, skipping insertion in model container [2022-11-23 14:48:10,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:48:09" (2/3) ... [2022-11-23 14:48:10,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f6d3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:48:10, skipping insertion in model container [2022-11-23 14:48:10,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:48:10" (3/3) ... [2022-11-23 14:48:10,848 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2022-11-23 14:48:10,858 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 14:48:10,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:48:10,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-23 14:48:10,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:48:10,930 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:48:10,965 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:48:10,980 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 159 transitions, 338 flow [2022-11-23 14:48:10,983 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 159 transitions, 338 flow [2022-11-23 14:48:10,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 159 transitions, 338 flow [2022-11-23 14:48:11,049 INFO L130 PetriNetUnfolder]: 2/155 cut-off events. [2022-11-23 14:48:11,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 14:48:11,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 155 events. 2/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2022-11-23 14:48:11,060 INFO L119 LiptonReduction]: Number of co-enabled transitions 3664 [2022-11-23 14:48:21,320 INFO L134 LiptonReduction]: Checked pairs total: 11452 [2022-11-23 14:48:21,320 INFO L136 LiptonReduction]: Total number of compositions: 138 [2022-11-23 14:48:21,342 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2022-11-23 14:48:21,703 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6202 states, 6195 states have (on average 4.121388216303471) internal successors, (25532), 6201 states have internal predecessors, (25532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:21,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:48:21,738 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;@8155613, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:48:21,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-23 14:48:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 6202 states, 6195 states have (on average 4.121388216303471) internal successors, (25532), 6201 states have internal predecessors, (25532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:48:21,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:21,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:48:21,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 738304822, now seen corresponding path program 1 times [2022-11-23 14:48:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:21,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908172943] [2022-11-23 14:48:21,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:21,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:22,412 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-23 14:48:22,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:22,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908172943] [2022-11-23 14:48:22,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908172943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:22,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:22,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:48:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824277966] [2022-11-23 14:48:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:48:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:22,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:48:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:48:22,470 INFO L87 Difference]: Start difference. First operand has 6202 states, 6195 states have (on average 4.121388216303471) internal successors, (25532), 6201 states have internal predecessors, (25532), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:22,752 INFO L93 Difference]: Finished difference Result 5232 states and 20786 transitions. [2022-11-23 14:48:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:48:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 14:48:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:22,835 INFO L225 Difference]: With dead ends: 5232 [2022-11-23 14:48:22,836 INFO L226 Difference]: Without dead ends: 5112 [2022-11-23 14:48:22,837 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-23 14:48:22,840 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:22,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:48:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2022-11-23 14:48:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 5112. [2022-11-23 14:48:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 5109 states have (on average 3.983166960266197) internal successors, (20350), 5111 states have internal predecessors, (20350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 20350 transitions. [2022-11-23 14:48:23,326 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 20350 transitions. Word has length 5 [2022-11-23 14:48:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:23,328 INFO L495 AbstractCegarLoop]: Abstraction has 5112 states and 20350 transitions. [2022-11-23 14:48:23,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 20350 transitions. [2022-11-23 14:48:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:48:23,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:23,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:48:23,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:48:23,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash 841393823, now seen corresponding path program 1 times [2022-11-23 14:48:23,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:23,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828005541] [2022-11-23 14:48:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:23,518 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-23 14:48:23,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:23,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828005541] [2022-11-23 14:48:23,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828005541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:23,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:23,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:48:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831478250] [2022-11-23 14:48:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:23,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:48:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:48:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:48:23,522 INFO L87 Difference]: Start difference. First operand 5112 states and 20350 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:23,706 INFO L93 Difference]: Finished difference Result 4152 states and 16292 transitions. [2022-11-23 14:48:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:48:23,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-23 14:48:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:23,738 INFO L225 Difference]: With dead ends: 4152 [2022-11-23 14:48:23,738 INFO L226 Difference]: Without dead ends: 3972 [2022-11-23 14:48:23,738 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-23 14:48:23,740 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:23,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:48:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2022-11-23 14:48:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3972. [2022-11-23 14:48:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3971 states have (on average 3.9456056408964995) internal successors, (15668), 3971 states have internal predecessors, (15668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 15668 transitions. [2022-11-23 14:48:24,007 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 15668 transitions. Word has length 7 [2022-11-23 14:48:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:24,008 INFO L495 AbstractCegarLoop]: Abstraction has 3972 states and 15668 transitions. [2022-11-23 14:48:24,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 15668 transitions. [2022-11-23 14:48:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:48:24,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:24,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:48:24,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:48:24,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash -557196353, now seen corresponding path program 1 times [2022-11-23 14:48:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512898971] [2022-11-23 14:48:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:24,707 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-23 14:48:24,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:24,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512898971] [2022-11-23 14:48:24,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512898971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:24,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:48:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026581226] [2022-11-23 14:48:24,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:24,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:48:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:48:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:48:24,709 INFO L87 Difference]: Start difference. First operand 3972 states and 15668 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:24,934 INFO L93 Difference]: Finished difference Result 3672 states and 14338 transitions. [2022-11-23 14:48:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:48:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-23 14:48:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:24,961 INFO L225 Difference]: With dead ends: 3672 [2022-11-23 14:48:24,961 INFO L226 Difference]: Without dead ends: 3672 [2022-11-23 14:48:24,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:48:24,963 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:24,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:48:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2022-11-23 14:48:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2022-11-23 14:48:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 3671 states have (on average 3.905747752655952) internal successors, (14338), 3671 states have internal predecessors, (14338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 14338 transitions. [2022-11-23 14:48:25,179 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 14338 transitions. Word has length 11 [2022-11-23 14:48:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:25,179 INFO L495 AbstractCegarLoop]: Abstraction has 3672 states and 14338 transitions. [2022-11-23 14:48:25,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 14338 transitions. [2022-11-23 14:48:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:48:25,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:25,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:48:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:48:25,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1405175928, now seen corresponding path program 1 times [2022-11-23 14:48:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:25,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472597837] [2022-11-23 14:48:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:25,841 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-23 14:48:25,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472597837] [2022-11-23 14:48:25,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472597837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:25,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:25,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:48:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480534046] [2022-11-23 14:48:25,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:25,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:48:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:48:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:48:25,844 INFO L87 Difference]: Start difference. First operand 3672 states and 14338 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:48:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:26,059 INFO L93 Difference]: Finished difference Result 3472 states and 13468 transitions. [2022-11-23 14:48:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:48:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:48:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:26,085 INFO L225 Difference]: With dead ends: 3472 [2022-11-23 14:48:26,085 INFO L226 Difference]: Without dead ends: 3472 [2022-11-23 14:48:26,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:48:26,086 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:26,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:48:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2022-11-23 14:48:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2022-11-23 14:48:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3471 states have (on average 3.8801498127340825) internal successors, (13468), 3471 states have internal predecessors, (13468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 13468 transitions. [2022-11-23 14:48:26,265 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 13468 transitions. Word has length 13 [2022-11-23 14:48:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:26,267 INFO L495 AbstractCegarLoop]: Abstraction has 3472 states and 13468 transitions. [2022-11-23 14:48:26,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:48:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 13468 transitions. [2022-11-23 14:48:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:48:26,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:26,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:48:26,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:48:26,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash -824463684, now seen corresponding path program 1 times [2022-11-23 14:48:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:26,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989716136] [2022-11-23 14:48:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:26,672 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-23 14:48:26,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:26,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989716136] [2022-11-23 14:48:26,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989716136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:26,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:26,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:48:26,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659160669] [2022-11-23 14:48:26,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:26,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:48:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:48:26,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:48:26,675 INFO L87 Difference]: Start difference. First operand 3472 states and 13468 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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-23 14:48:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:26,925 INFO L93 Difference]: Finished difference Result 3428 states and 12088 transitions. [2022-11-23 14:48:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:48:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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-23 14:48:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:26,938 INFO L225 Difference]: With dead ends: 3428 [2022-11-23 14:48:26,939 INFO L226 Difference]: Without dead ends: 2528 [2022-11-23 14:48:26,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 14:48:26,940 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:26,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 20 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:48:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2022-11-23 14:48:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2022-11-23 14:48:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 3.4618124258013454) internal successors, (8748), 2527 states have internal predecessors, (8748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 8748 transitions. [2022-11-23 14:48:27,024 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 8748 transitions. Word has length 15 [2022-11-23 14:48:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:27,024 INFO L495 AbstractCegarLoop]: Abstraction has 2528 states and 8748 transitions. [2022-11-23 14:48:27,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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-23 14:48:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 8748 transitions. [2022-11-23 14:48:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:48:27,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:27,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:48:27,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:48:27,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -847388200, now seen corresponding path program 1 times [2022-11-23 14:48:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:27,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755688315] [2022-11-23 14:48:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:27,524 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-23 14:48:27,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:27,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755688315] [2022-11-23 14:48:27,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755688315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:27,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:27,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:48:27,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046407091] [2022-11-23 14:48:27,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:27,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:48:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:27,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:48:27,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:48:27,527 INFO L87 Difference]: Start difference. First operand 2528 states and 8748 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:27,826 INFO L93 Difference]: Finished difference Result 2140 states and 6896 transitions. [2022-11-23 14:48:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:48:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 14:48:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:27,834 INFO L225 Difference]: With dead ends: 2140 [2022-11-23 14:48:27,834 INFO L226 Difference]: Without dead ends: 1640 [2022-11-23 14:48:27,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:48:27,836 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:27,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 28 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:48:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-11-23 14:48:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2022-11-23 14:48:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.1702257474069553) internal successors, (5196), 1639 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5196 transitions. [2022-11-23 14:48:27,887 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5196 transitions. Word has length 18 [2022-11-23 14:48:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:27,887 INFO L495 AbstractCegarLoop]: Abstraction has 1640 states and 5196 transitions. [2022-11-23 14:48:27,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5196 transitions. [2022-11-23 14:48:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:48:27,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:27,892 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] [2022-11-23 14:48:27,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:48:27,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2064690286, now seen corresponding path program 1 times [2022-11-23 14:48:27,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:27,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607697388] [2022-11-23 14:48:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:28,518 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-23 14:48:28,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:28,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607697388] [2022-11-23 14:48:28,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607697388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:28,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:28,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:48:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734618706] [2022-11-23 14:48:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:28,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:48:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:48:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:48:28,524 INFO L87 Difference]: Start difference. First operand 1640 states and 5196 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:28,860 INFO L93 Difference]: Finished difference Result 1465 states and 4632 transitions. [2022-11-23 14:48:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:48:28,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-23 14:48:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:28,866 INFO L225 Difference]: With dead ends: 1465 [2022-11-23 14:48:28,866 INFO L226 Difference]: Without dead ends: 1325 [2022-11-23 14:48:28,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:48:28,867 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 139 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:28,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 32 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:48:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-11-23 14:48:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-11-23 14:48:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 3.210725075528701) internal successors, (4251), 1324 states have internal predecessors, (4251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4251 transitions. [2022-11-23 14:48:28,906 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4251 transitions. Word has length 21 [2022-11-23 14:48:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:28,907 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 4251 transitions. [2022-11-23 14:48:28,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4251 transitions. [2022-11-23 14:48:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:48:28,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:28,912 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] [2022-11-23 14:48:28,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:48:28,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1456613769, now seen corresponding path program 1 times [2022-11-23 14:48:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:28,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029211718] [2022-11-23 14:48:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:29,367 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-23 14:48:29,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:29,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029211718] [2022-11-23 14:48:29,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029211718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:29,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:29,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:48:29,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574166568] [2022-11-23 14:48:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:29,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:48:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:48:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:48:29,370 INFO L87 Difference]: Start difference. First operand 1325 states and 4251 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:29,591 INFO L93 Difference]: Finished difference Result 1718 states and 5409 transitions. [2022-11-23 14:48:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:48:29,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 14:48:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:29,599 INFO L225 Difference]: With dead ends: 1718 [2022-11-23 14:48:29,599 INFO L226 Difference]: Without dead ends: 1328 [2022-11-23 14:48:29,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 14:48:29,600 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:29,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:48:29,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-11-23 14:48:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1325. [2022-11-23 14:48:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 3.1185800604229605) internal successors, (4129), 1324 states have internal predecessors, (4129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4129 transitions. [2022-11-23 14:48:29,651 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4129 transitions. Word has length 25 [2022-11-23 14:48:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:29,652 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 4129 transitions. [2022-11-23 14:48:29,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4129 transitions. [2022-11-23 14:48:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:48:29,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:29,657 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] [2022-11-23 14:48:29,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:48:29,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 77781960, now seen corresponding path program 1 times [2022-11-23 14:48:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:29,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382786640] [2022-11-23 14:48:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:30,345 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-23 14:48:30,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382786640] [2022-11-23 14:48:30,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382786640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:30,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:48:30,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324560402] [2022-11-23 14:48:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:30,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:48:30,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:30,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:48:30,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:48:30,347 INFO L87 Difference]: Start difference. First operand 1325 states and 4129 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:30,759 INFO L93 Difference]: Finished difference Result 1810 states and 5514 transitions. [2022-11-23 14:48:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:48:30,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 14:48:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:30,764 INFO L225 Difference]: With dead ends: 1810 [2022-11-23 14:48:30,765 INFO L226 Difference]: Without dead ends: 1232 [2022-11-23 14:48:30,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:48:30,765 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:30,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 10 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:48:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-23 14:48:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1229. [2022-11-23 14:48:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 2.978013029315961) internal successors, (3657), 1228 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 3657 transitions. [2022-11-23 14:48:30,821 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 3657 transitions. Word has length 25 [2022-11-23 14:48:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:30,823 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 3657 transitions. [2022-11-23 14:48:30,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 3657 transitions. [2022-11-23 14:48:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:48:30,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:30,827 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] [2022-11-23 14:48:30,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:48:30,828 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1469594472, now seen corresponding path program 2 times [2022-11-23 14:48:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:30,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008958899] [2022-11-23 14:48:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:48:31,495 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-23 14:48:31,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:48:31,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008958899] [2022-11-23 14:48:31,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008958899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:48:31,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:48:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:48:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14864352] [2022-11-23 14:48:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:48:31,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:48:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:31,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:48:31,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:48:31,502 INFO L87 Difference]: Start difference. First operand 1229 states and 3657 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:48:31,818 INFO L93 Difference]: Finished difference Result 1198 states and 3595 transitions. [2022-11-23 14:48:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:48:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 14:48:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:48:31,820 INFO L225 Difference]: With dead ends: 1198 [2022-11-23 14:48:31,820 INFO L226 Difference]: Without dead ends: 415 [2022-11-23 14:48:31,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:48:31,821 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:48:31,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 26 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:48:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-23 14:48:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2022-11-23 14:48:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 2.7657004830917873) internal successors, (1145), 414 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1145 transitions. [2022-11-23 14:48:31,834 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1145 transitions. Word has length 25 [2022-11-23 14:48:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:48:31,834 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 1145 transitions. [2022-11-23 14:48:31,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:48:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1145 transitions. [2022-11-23 14:48:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 14:48:31,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:48:31,838 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] [2022-11-23 14:48:31,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:48:31,838 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-23 14:48:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:48:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1947069451, now seen corresponding path program 1 times [2022-11-23 14:48:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:48:31,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123889474] [2022-11-23 14:48:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:48:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:48:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:48:32,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:48:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:48:32,255 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:48:32,256 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:48:32,257 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-11-23 14:48:32,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-11-23 14:48:32,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-11-23 14:48:32,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-11-23 14:48:32,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-11-23 14:48:32,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-11-23 14:48:32,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-11-23 14:48:32,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-11-23 14:48:32,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-11-23 14:48:32,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:48:32,263 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:48:32,268 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 14:48:32,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:48:32,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:48:32 BasicIcfg [2022-11-23 14:48:32,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:48:32,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:48:32,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:48:32,441 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:48:32,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:48:10" (3/4) ... [2022-11-23 14:48:32,449 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 14:48:32,606 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:48:32,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:48:32,607 INFO L158 Benchmark]: Toolchain (without parser) took 23830.47ms. Allocated memory was 186.6MB in the beginning and 568.3MB in the end (delta: 381.7MB). Free memory was 141.1MB in the beginning and 392.9MB in the end (delta: -251.7MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,607 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 146.8MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 180.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.86ms. Allocated memory is still 186.6MB. Free memory was 140.6MB in the beginning and 112.8MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.50ms. Allocated memory is still 186.6MB. Free memory was 112.8MB in the beginning and 108.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,608 INFO L158 Benchmark]: Boogie Preprocessor took 58.09ms. Allocated memory is still 186.6MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,608 INFO L158 Benchmark]: RCFGBuilder took 1130.16ms. Allocated memory is still 186.6MB. Free memory was 106.0MB in the beginning and 105.5MB in the end (delta: 531.0kB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,610 INFO L158 Benchmark]: TraceAbstraction took 21598.47ms. Allocated memory was 186.6MB in the beginning and 568.3MB in the end (delta: 381.7MB). Free memory was 104.5MB in the beginning and 418.0MB in the end (delta: -313.6MB). Peak memory consumption was 355.8MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,610 INFO L158 Benchmark]: Witness Printer took 165.31ms. Allocated memory is still 568.3MB. Free memory was 418.0MB in the beginning and 392.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 14:48:32,612 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.30ms. Allocated memory is still 146.8MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 180.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.86ms. Allocated memory is still 186.6MB. Free memory was 140.6MB in the beginning and 112.8MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.50ms. Allocated memory is still 186.6MB. Free memory was 112.8MB in the beginning and 108.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.09ms. Allocated memory is still 186.6MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.16ms. Allocated memory is still 186.6MB. Free memory was 106.0MB in the beginning and 105.5MB in the end (delta: 531.0kB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21598.47ms. Allocated memory was 186.6MB in the beginning and 568.3MB in the end (delta: 381.7MB). Free memory was 104.5MB in the beginning and 418.0MB in the end (delta: -313.6MB). Peak memory consumption was 355.8MB. Max. memory is 16.1GB. * Witness Printer took 165.31ms. Allocated memory is still 568.3MB. Free memory was 418.0MB in the beginning and 392.9MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3s, 170 PlacesBefore, 49 PlacesAfterwards, 159 TransitionsBefore, 37 TransitionsAfterwards, 3664 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 138 TotalNumberOfCompositions, 11452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4686, independent: 4394, independent conditional: 0, independent unconditional: 4394, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2547, independent: 2463, independent conditional: 0, independent unconditional: 2463, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2547, independent: 2414, independent conditional: 0, independent unconditional: 2414, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 133, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1178, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 1099, dependent conditional: 0, dependent unconditional: 1099, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4686, independent: 1931, independent conditional: 0, independent unconditional: 1931, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 2547, unknown conditional: 0, unknown unconditional: 2547] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 223, Positive conditional cache size: 0, Positive unconditional cache size: 223, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool y$flush_delayed; [L748] 0 int y$mem_tmp; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L754] 0 _Bool y$r_buff1_thd0; [L755] 0 _Bool y$r_buff1_thd1; [L756] 0 _Bool y$r_buff1_thd2; [L757] 0 _Bool y$r_buff1_thd3; [L758] 0 _Bool y$r_buff1_thd4; [L759] 0 _Bool y$read_delayed; [L760] 0 int *y$read_delayed_var; [L761] 0 int y$w_buff0; [L762] 0 _Bool y$w_buff0_used; [L763] 0 int y$w_buff1; [L764] 0 _Bool y$w_buff1_used; [L766] 0 int z = 0; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=-3, t377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=-2, t377={5:0}, t378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=-1, t377={5:0}, t378={6:0}, t379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L928] 0 pthread_t t380; [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L886] 4 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L889] 4 __unbuffered_p3_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L892] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L895] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L775] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L826] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L827] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L828] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L829] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L830] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L831] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L867] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L872] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L940] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L952] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L953] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L954] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L955] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L957] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=3, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 923]: 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: 925]: 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: 927]: 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: 929]: 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, 198 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1052 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 60 mSDtfsCounter, 1052 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6202occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 14:48:32,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03f895b8-0691-4efb-9fc3-f0bbc1510100/bin/utaipan-Q6hlc19bkW/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