./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:29:03,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:29:03,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:29:03,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:29:03,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:29:03,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:29:03,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:29:03,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:29:03,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:29:03,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:29:03,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:29:03,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:29:03,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:29:03,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:29:03,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:29:03,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:29:03,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:29:03,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:29:03,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:29:03,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:29:03,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:29:03,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:29:03,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:29:03,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:29:03,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:29:03,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:29:03,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:29:03,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:29:03,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:29:03,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:29:03,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:29:03,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:29:03,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:29:03,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:29:03,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:29:03,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:29:03,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:29:03,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:29:03,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:29:03,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:29:03,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:29:03,784 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:29:03,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:29:03,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:29:03,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:29:03,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:29:03,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:29:03,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:29:03,829 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:29:03,829 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:29:03,830 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:29:03,830 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:29:03,831 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:29:03,831 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:29:03,831 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:29:03,832 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:29:03,832 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:29:03,832 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:29:03,832 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:29:03,832 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:29:03,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:29:03,833 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:29:03,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:29:03,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:29:03,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:29:03,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:29:03,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:29:03,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:29:03,835 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:29:03,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:29:03,835 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:29:03,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:29:03,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:29:03,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:29:03,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:29:03,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:29:03,837 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:29:03,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:29:03,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:29:03,838 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:29:03,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:29:03,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:29:03,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:29:03,838 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_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2022-11-03 03:29:04,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:29:04,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:29:04,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:29:04,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:29:04,197 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:29:04,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/rfi004.i [2022-11-03 03:29:04,283 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/data/88f7c89c6/f299549926794ec99e7c839a7841a3b4/FLAG91567d721 [2022-11-03 03:29:04,883 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:29:04,884 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/sv-benchmarks/c/pthread-wmm/rfi004.i [2022-11-03 03:29:04,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/data/88f7c89c6/f299549926794ec99e7c839a7841a3b4/FLAG91567d721 [2022-11-03 03:29:05,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/data/88f7c89c6/f299549926794ec99e7c839a7841a3b4 [2022-11-03 03:29:05,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:29:05,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:29:05,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:29:05,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:29:05,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:29:05,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed983bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05, skipping insertion in model container [2022-11-03 03:29:05,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:29:05,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:29:05,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2022-11-03 03:29:05,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:29:05,680 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:29:05,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2022-11-03 03:29:05,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:29:05,797 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:29:05,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05 WrapperNode [2022-11-03 03:29:05,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:29:05,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:29:05,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:29:05,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:29:05,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,879 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2022-11-03 03:29:05,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:29:05,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:29:05,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:29:05,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:29:05,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:29:05,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:29:05,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:29:05,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:29:05,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (1/1) ... [2022-11-03 03:29:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:29:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:29:05,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:29:05,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:29:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:29:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:29:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:29:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:29:06,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:29:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 03:29:06,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 03:29:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 03:29:06,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 03:29:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:29:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:29:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:29:06,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:29:06,019 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:29:06,156 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:29:06,164 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:29:06,799 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:29:07,283 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:29:07,284 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:29:07,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:29:07 BoogieIcfgContainer [2022-11-03 03:29:07,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:29:07,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:29:07,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:29:07,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:29:07,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:29:05" (1/3) ... [2022-11-03 03:29:07,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1544dfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:29:07, skipping insertion in model container [2022-11-03 03:29:07,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:29:05" (2/3) ... [2022-11-03 03:29:07,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1544dfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:29:07, skipping insertion in model container [2022-11-03 03:29:07,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:29:07" (3/3) ... [2022-11-03 03:29:07,299 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2022-11-03 03:29:07,310 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:29:07,321 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:29:07,321 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 03:29:07,322 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:29:07,403 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:29:07,454 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:29:07,468 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-03 03:29:07,471 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-03 03:29:07,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-03 03:29:07,524 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-03 03:29:07,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 03:29:07,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-03 03:29:07,529 INFO L118 LiptonReduction]: Number of co-enabled transitions 1196 [2022-11-03 03:29:13,560 INFO L133 LiptonReduction]: Checked pairs total: 2631 [2022-11-03 03:29:13,560 INFO L135 LiptonReduction]: Total number of compositions: 89 [2022-11-03 03:29:13,569 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2022-11-03 03:29:13,602 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 158 states, 155 states have (on average 2.574193548387097) internal successors, (399), 157 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:13,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:29:13,625 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;@6d8de49b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:29:13,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 03:29:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 155 states have (on average 2.574193548387097) internal successors, (399), 157 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:29:13,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:13,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:29:13,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:29:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash 847563309, now seen corresponding path program 1 times [2022-11-03 03:29:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:13,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601093364] [2022-11-03 03:29:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:14,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:14,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601093364] [2022-11-03 03:29:14,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601093364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:14,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:14,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:29:14,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913013599] [2022-11-03 03:29:14,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:14,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:29:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:29:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:29:14,225 INFO L87 Difference]: Start difference. First operand has 158 states, 155 states have (on average 2.574193548387097) internal successors, (399), 157 states have internal predecessors, (399), 0 states have call successors, (0), 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-03 03:29:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:14,306 INFO L93 Difference]: Finished difference Result 134 states and 309 transitions. [2022-11-03 03:29:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:29:14,309 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-03 03:29:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:14,324 INFO L225 Difference]: With dead ends: 134 [2022-11-03 03:29:14,324 INFO L226 Difference]: Without dead ends: 130 [2022-11-03 03:29:14,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:29:14,330 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:14,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:29:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-03 03:29:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-03 03:29:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.3410852713178296) internal successors, (302), 129 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 302 transitions. [2022-11-03 03:29:14,403 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 302 transitions. Word has length 5 [2022-11-03 03:29:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:14,405 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 302 transitions. [2022-11-03 03:29:14,405 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-03 03:29:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 302 transitions. [2022-11-03 03:29:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:29:14,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:14,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:29:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:29:14,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:29:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -352428778, now seen corresponding path program 1 times [2022-11-03 03:29:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:14,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249027801] [2022-11-03 03:29:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:14,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:14,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249027801] [2022-11-03 03:29:14,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249027801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:14,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:14,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:29:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000292137] [2022-11-03 03:29:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:14,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:29:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:14,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:29:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:29:14,635 INFO L87 Difference]: Start difference. First operand 130 states and 302 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:14,770 INFO L93 Difference]: Finished difference Result 138 states and 304 transitions. [2022-11-03 03:29:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:29:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 03:29:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:14,772 INFO L225 Difference]: With dead ends: 138 [2022-11-03 03:29:14,773 INFO L226 Difference]: Without dead ends: 114 [2022-11-03 03:29:14,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:14,777 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:14,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:29:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-03 03:29:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-03 03:29:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.2831858407079646) internal successors, (258), 113 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 258 transitions. [2022-11-03 03:29:14,795 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 258 transitions. Word has length 8 [2022-11-03 03:29:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:14,795 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 258 transitions. [2022-11-03 03:29:14,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 258 transitions. [2022-11-03 03:29:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:29:14,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:14,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:29:14,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:29:14,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:29:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash 617559882, now seen corresponding path program 1 times [2022-11-03 03:29:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:14,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219984916] [2022-11-03 03:29:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:15,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219984916] [2022-11-03 03:29:15,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219984916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:15,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:15,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:29:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137737383] [2022-11-03 03:29:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:15,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:29:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:29:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:29:15,041 INFO L87 Difference]: Start difference. First operand 114 states and 258 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:15,121 INFO L93 Difference]: Finished difference Result 90 states and 167 transitions. [2022-11-03 03:29:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:29:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-03 03:29:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:15,122 INFO L225 Difference]: With dead ends: 90 [2022-11-03 03:29:15,122 INFO L226 Difference]: Without dead ends: 66 [2022-11-03 03:29:15,123 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-03 03:29:15,124 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:15,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:29:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-03 03:29:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-03 03:29:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.7538461538461538) internal successors, (114), 65 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 114 transitions. [2022-11-03 03:29:15,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 114 transitions. Word has length 10 [2022-11-03 03:29:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:15,129 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 114 transitions. [2022-11-03 03:29:15,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2022-11-03 03:29:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:29:15,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:15,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:29:15,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:29:15,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:29:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1852365357, now seen corresponding path program 1 times [2022-11-03 03:29:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:15,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900183564] [2022-11-03 03:29:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:15,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:15,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900183564] [2022-11-03 03:29:15,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900183564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:15,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:15,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:29:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173550012] [2022-11-03 03:29:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:15,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:29:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:29:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:15,396 INFO L87 Difference]: Start difference. First operand 66 states and 114 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:15,492 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2022-11-03 03:29:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:29:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 03:29:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:15,493 INFO L225 Difference]: With dead ends: 47 [2022-11-03 03:29:15,493 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 03:29:15,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:29:15,494 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:15,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:29:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 03:29:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-03 03:29:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-11-03 03:29:15,498 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 13 [2022-11-03 03:29:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:15,499 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-11-03 03:29:15,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-11-03 03:29:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:29:15,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:15,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:29:15,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:29:15,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:29:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1970466127, now seen corresponding path program 1 times [2022-11-03 03:29:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:15,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107946546] [2022-11-03 03:29:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:15,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107946546] [2022-11-03 03:29:15,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107946546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:15,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:15,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:29:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704947245] [2022-11-03 03:29:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:15,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:29:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:29:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:15,716 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:15,813 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2022-11-03 03:29:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:29:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:29:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:15,814 INFO L225 Difference]: With dead ends: 50 [2022-11-03 03:29:15,814 INFO L226 Difference]: Without dead ends: 23 [2022-11-03 03:29:15,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:29:15,816 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:15,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:29:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-03 03:29:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-03 03:29:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-03 03:29:15,820 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-11-03 03:29:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:15,820 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-03 03:29:15,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:29:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-03 03:29:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:29:15,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:15,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:29:15,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:29:15,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:29:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash 973206757, now seen corresponding path program 2 times [2022-11-03 03:29:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:15,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225148041] [2022-11-03 03:29:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:29:15,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:29:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:29:15,978 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:29:15,978 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:29:15,979 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-03 03:29:15,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-03 03:29:15,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-03 03:29:15,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-03 03:29:15,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-03 03:29:15,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:29:15,984 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-03 03:29:15,990 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 03:29:15,990 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:29:16,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:29:16 BasicIcfg [2022-11-03 03:29:16,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:29:16,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:29:16,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:29:16,045 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:29:16,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:29:07" (3/4) ... [2022-11-03 03:29:16,047 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:29:16,132 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:29:16,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:29:16,133 INFO L158 Benchmark]: Toolchain (without parser) took 10949.54ms. Allocated memory was 111.1MB in the beginning and 190.8MB in the end (delta: 79.7MB). Free memory was 74.6MB in the beginning and 57.0MB in the end (delta: 17.6MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,133 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 111.1MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:29:16,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.44ms. Allocated memory is still 111.1MB. Free memory was 74.4MB in the beginning and 74.0MB in the end (delta: 365.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.23ms. Allocated memory is still 111.1MB. Free memory was 74.0MB in the beginning and 71.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,134 INFO L158 Benchmark]: Boogie Preprocessor took 31.65ms. Allocated memory is still 111.1MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,134 INFO L158 Benchmark]: RCFGBuilder took 1375.13ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 69.4MB in the beginning and 113.1MB in the end (delta: -43.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,135 INFO L158 Benchmark]: TraceAbstraction took 8754.14ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 111.9MB in the beginning and 66.4MB in the end (delta: 45.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,135 INFO L158 Benchmark]: Witness Printer took 87.39ms. Allocated memory is still 190.8MB. Free memory was 66.4MB in the beginning and 57.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:29:16,138 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.22ms. Allocated memory is still 111.1MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.44ms. Allocated memory is still 111.1MB. Free memory was 74.4MB in the beginning and 74.0MB in the end (delta: 365.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.23ms. Allocated memory is still 111.1MB. Free memory was 74.0MB in the beginning and 71.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.65ms. Allocated memory is still 111.1MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1375.13ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 69.4MB in the beginning and 113.1MB in the end (delta: -43.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8754.14ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 111.9MB in the beginning and 66.4MB in the end (delta: 45.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 87.39ms. Allocated memory is still 190.8MB. Free memory was 66.4MB in the beginning and 57.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 103 PlacesBefore, 27 PlacesAfterwards, 98 TransitionsBefore, 21 TransitionsAfterwards, 1196 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 2631 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1505, positive: 1389, positive conditional: 0, positive unconditional: 1389, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 877, positive: 841, positive conditional: 0, positive unconditional: 841, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 877, positive: 830, positive conditional: 0, positive unconditional: 830, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 498, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 466, negative conditional: 0, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1505, positive: 548, positive conditional: 0, positive unconditional: 548, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 877, unknown conditional: 0, unknown unconditional: 877] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=0, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=1, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L753] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L754] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L755] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L756] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L757] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L757] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L758] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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: 19]: 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: 818]: 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: 816]: 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 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 236 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 6 mSDtfsCounter, 236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 03:29:16,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a2a8f94-26c1-4b7d-b741-49b58950ac61/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE