./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:52:50,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:52:50,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:52:50,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:52:50,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:52:50,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:52:50,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:52:50,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:52:50,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:52:50,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:52:50,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:52:50,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:52:50,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:52:50,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:52:50,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:52:50,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:52:50,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:52:50,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:52:50,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:52:50,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:52:50,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:52:50,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:52:50,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:52:50,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:52:50,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:52:50,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:52:50,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:52:50,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:52:50,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:52:50,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:52:50,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:52:50,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:52:50,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:52:50,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:52:50,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:52:50,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:52:50,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:52:50,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:52:50,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:52:50,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:52:50,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:52:50,109 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:52:50,152 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:52:50,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:52:50,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:52:50,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:52:50,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:52:50,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:52:50,155 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:52:50,156 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:52:50,156 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:52:50,156 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:52:50,157 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:52:50,158 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:52:50,158 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:52:50,158 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:52:50,158 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:52:50,159 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:52:50,159 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:52:50,159 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:52:50,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:52:50,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:52:50,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:52:50,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:52:50,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:52:50,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:52:50,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:52:50,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:52:50,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:52:50,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:52:50,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:52:50,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:52:50,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:52:50,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:52:50,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:50,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:52:50,164 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:52:50,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:52:50,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:52:50,165 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:52:50,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:52:50,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:52:50,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:52:50,167 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_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2022-11-23 13:52:50,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:52:50,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:52:50,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:52:50,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:52:50,556 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:52:50,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-23 13:52:53,854 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:52:54,237 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:52:54,238 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-23 13:52:54,255 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/data/a60f07b79/eedacd5623914e1784ed8104829696e9/FLAG15be01f4b [2022-11-23 13:52:54,271 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/data/a60f07b79/eedacd5623914e1784ed8104829696e9 [2022-11-23 13:52:54,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:52:54,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:52:54,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:54,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:52:54,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:52:54,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:54,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597e08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54, skipping insertion in model container [2022-11-23 13:52:54,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:54,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:52:54,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:52:54,506 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-11-23 13:52:54,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:54,818 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:52:54,839 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-11-23 13:52:54,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:54,963 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:52:54,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54 WrapperNode [2022-11-23 13:52:54,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:54,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:54,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:52:54,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:52:54,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,042 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2022-11-23 13:52:55,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:55,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:52:55,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:52:55,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:52:55,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,107 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:52:55,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:52:55,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:52:55,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:52:55,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (1/1) ... [2022-11-23 13:52:55,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:55,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:55,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:52:55,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:52:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:52:55,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 13:52:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:52:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:52:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:52:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 13:52:55,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 13:52:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 13:52:55,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 13:52:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:52:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 13:52:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:52:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:52:55,238 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:52:55,466 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:52:55,468 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:52:55,854 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:52:56,127 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:52:56,127 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:52:56,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:56 BoogieIcfgContainer [2022-11-23 13:52:56,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:52:56,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:52:56,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:52:56,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:52:56,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:54" (1/3) ... [2022-11-23 13:52:56,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e03ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:56, skipping insertion in model container [2022-11-23 13:52:56,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:54" (2/3) ... [2022-11-23 13:52:56,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e03ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:56, skipping insertion in model container [2022-11-23 13:52:56,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:56" (3/3) ... [2022-11-23 13:52:56,143 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-23 13:52:56,155 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 13:52:56,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:52:56,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 13:52:56,169 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:52:56,230 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 13:52:56,307 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:52:56,363 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 204 flow [2022-11-23 13:52:56,366 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 204 flow [2022-11-23 13:52:56,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-11-23 13:52:56,429 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-23 13:52:56,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 13:52:56,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-23 13:52:56,438 INFO L119 LiptonReduction]: Number of co-enabled transitions 1196 [2022-11-23 13:53:01,781 INFO L134 LiptonReduction]: Checked pairs total: 3314 [2022-11-23 13:53:01,781 INFO L136 LiptonReduction]: Total number of compositions: 90 [2022-11-23 13:53:01,797 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2022-11-23 13:53:01,869 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 146 states, 143 states have (on average 2.4195804195804196) internal successors, (346), 145 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:01,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:53:01,920 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;@5a12f66c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:53:01,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-23 13:53:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 143 states have (on average 2.4195804195804196) internal successors, (346), 145 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 13:53:01,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:01,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 13:53:01,940 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-23 13:53:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash 403814369, now seen corresponding path program 1 times [2022-11-23 13:53:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140721692] [2022-11-23 13:53:01,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:02,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:02,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140721692] [2022-11-23 13:53:02,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140721692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:02,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:02,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:53:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844368649] [2022-11-23 13:53:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:02,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:02,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:02,582 INFO L87 Difference]: Start difference. First operand has 146 states, 143 states have (on average 2.4195804195804196) internal successors, (346), 145 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:02,684 INFO L93 Difference]: Finished difference Result 126 states and 287 transitions. [2022-11-23 13:53:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:02,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 13:53:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:02,706 INFO L225 Difference]: With dead ends: 126 [2022-11-23 13:53:02,707 INFO L226 Difference]: Without dead ends: 122 [2022-11-23 13:53:02,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:02,714 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:02,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-23 13:53:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-23 13:53:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.3140495867768593) internal successors, (280), 121 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 280 transitions. [2022-11-23 13:53:02,801 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 280 transitions. Word has length 5 [2022-11-23 13:53:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:02,804 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 280 transitions. [2022-11-23 13:53:02,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 280 transitions. [2022-11-23 13:53:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:53:02,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:02,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:53:02,814 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-23 13:53:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1518600683, now seen corresponding path program 1 times [2022-11-23 13:53:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643506880] [2022-11-23 13:53:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:03,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:03,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643506880] [2022-11-23 13:53:03,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643506880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:03,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:03,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:53:03,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527815991] [2022-11-23 13:53:03,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:03,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:03,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:03,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:03,098 INFO L87 Difference]: Start difference. First operand 122 states and 280 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:03,192 INFO L93 Difference]: Finished difference Result 175 states and 378 transitions. [2022-11-23 13:53:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:03,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-23 13:53:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:03,201 INFO L225 Difference]: With dead ends: 175 [2022-11-23 13:53:03,202 INFO L226 Difference]: Without dead ends: 145 [2022-11-23 13:53:03,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:03,205 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:03,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-23 13:53:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 130. [2022-11-23 13:53:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.1627906976744184) internal successors, (279), 129 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 279 transitions. [2022-11-23 13:53:03,234 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 279 transitions. Word has length 7 [2022-11-23 13:53:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:03,235 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 279 transitions. [2022-11-23 13:53:03,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 279 transitions. [2022-11-23 13:53:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 13:53:03,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:03,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:03,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:53:03,237 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-23 13:53:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1553571324, now seen corresponding path program 1 times [2022-11-23 13:53:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645987038] [2022-11-23 13:53:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:03,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:03,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645987038] [2022-11-23 13:53:03,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645987038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:03,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:03,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:53:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436078997] [2022-11-23 13:53:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:03,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:03,390 INFO L87 Difference]: Start difference. First operand 130 states and 279 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-23 13:53:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:03,441 INFO L93 Difference]: Finished difference Result 121 states and 255 transitions. [2022-11-23 13:53:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-23 13:53:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:03,444 INFO L225 Difference]: With dead ends: 121 [2022-11-23 13:53:03,444 INFO L226 Difference]: Without dead ends: 99 [2022-11-23 13:53:03,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:03,446 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:03,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:53:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-23 13:53:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-11-23 13:53:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.136842105263158) internal successors, (203), 95 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 203 transitions. [2022-11-23 13:53:03,455 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 203 transitions. Word has length 8 [2022-11-23 13:53:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:03,456 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 203 transitions. [2022-11-23 13:53:03,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-23 13:53:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 203 transitions. [2022-11-23 13:53:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 13:53:03,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:03,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:03,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:53:03,458 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-23 13:53:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1522747246, now seen corresponding path program 1 times [2022-11-23 13:53:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:03,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007628524] [2022-11-23 13:53:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:03,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:03,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007628524] [2022-11-23 13:53:03,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007628524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:03,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:03,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:53:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959223941] [2022-11-23 13:53:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:03,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:03,779 INFO L87 Difference]: Start difference. First operand 96 states and 203 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:03,854 INFO L93 Difference]: Finished difference Result 93 states and 195 transitions. [2022-11-23 13:53:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:53:03,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 13:53:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:03,856 INFO L225 Difference]: With dead ends: 93 [2022-11-23 13:53:03,857 INFO L226 Difference]: Without dead ends: 87 [2022-11-23 13:53:03,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:03,861 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:03,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-23 13:53:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-11-23 13:53:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.1325301204819276) internal successors, (177), 83 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 177 transitions. [2022-11-23 13:53:03,889 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 177 transitions. Word has length 11 [2022-11-23 13:53:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:03,890 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 177 transitions. [2022-11-23 13:53:03,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 177 transitions. [2022-11-23 13:53:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:53:03,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:03,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:03,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:53:03,893 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-23 13:53:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -5851901, now seen corresponding path program 1 times [2022-11-23 13:53:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:03,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639595425] [2022-11-23 13:53:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:04,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639595425] [2022-11-23 13:53:04,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639595425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:04,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:04,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641239121] [2022-11-23 13:53:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:04,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:04,231 INFO L87 Difference]: Start difference. First operand 84 states and 177 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:04,328 INFO L93 Difference]: Finished difference Result 71 states and 127 transitions. [2022-11-23 13:53:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:04,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:53:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:04,330 INFO L225 Difference]: With dead ends: 71 [2022-11-23 13:53:04,330 INFO L226 Difference]: Without dead ends: 48 [2022-11-23 13:53:04,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:04,331 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:04,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-23 13:53:04,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-23 13:53:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 47 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2022-11-23 13:53:04,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 12 [2022-11-23 13:53:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:04,337 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2022-11-23 13:53:04,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2022-11-23 13:53:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:53:04,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:04,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:04,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:53:04,339 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-23 13:53:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2046694999, now seen corresponding path program 1 times [2022-11-23 13:53:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:04,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800810884] [2022-11-23 13:53:04,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:04,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:04,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800810884] [2022-11-23 13:53:04,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800810884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:04,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:04,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47641545] [2022-11-23 13:53:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:04,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:04,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:04,614 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:04,705 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2022-11-23 13:53:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:53:04,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:53:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:04,708 INFO L225 Difference]: With dead ends: 70 [2022-11-23 13:53:04,708 INFO L226 Difference]: Without dead ends: 45 [2022-11-23 13:53:04,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:04,710 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:04,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-23 13:53:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-11-23 13:53:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2022-11-23 13:53:04,725 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 14 [2022-11-23 13:53:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:04,725 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2022-11-23 13:53:04,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2022-11-23 13:53:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:53:04,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:04,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:04,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:53:04,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 13:53:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash -919652981, now seen corresponding path program 2 times [2022-11-23 13:53:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638970250] [2022-11-23 13:53:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:04,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638970250] [2022-11-23 13:53:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638970250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:04,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:04,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409607760] [2022-11-23 13:53:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:04,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:04,987 INFO L87 Difference]: Start difference. First operand 44 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:05,115 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-11-23 13:53:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:53:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:05,117 INFO L225 Difference]: With dead ends: 64 [2022-11-23 13:53:05,117 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 13:53:05,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:05,118 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:05,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 13:53:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-23 13:53:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2022-11-23 13:53:05,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 14 [2022-11-23 13:53:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:05,122 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2022-11-23 13:53:05,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-11-23 13:53:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:53:05,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:05,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:05,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:53:05,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 13:53:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1627487427, now seen corresponding path program 3 times [2022-11-23 13:53:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665668398] [2022-11-23 13:53:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:05,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665668398] [2022-11-23 13:53:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665668398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:05,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:05,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526264799] [2022-11-23 13:53:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:05,368 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:05,455 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2022-11-23 13:53:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:05,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:53:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:05,456 INFO L225 Difference]: With dead ends: 57 [2022-11-23 13:53:05,456 INFO L226 Difference]: Without dead ends: 37 [2022-11-23 13:53:05,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:05,458 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:05,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-23 13:53:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-23 13:53:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 36 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2022-11-23 13:53:05,461 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 14 [2022-11-23 13:53:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:05,461 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2022-11-23 13:53:05,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2022-11-23 13:53:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:53:05,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:05,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:05,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:53:05,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 13:53:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1622730259, now seen corresponding path program 4 times [2022-11-23 13:53:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:05,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256225135] [2022-11-23 13:53:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:05,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:05,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256225135] [2022-11-23 13:53:05,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256225135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:05,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:05,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005000473] [2022-11-23 13:53:05,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:05,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:05,747 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:05,838 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-23 13:53:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:53:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:05,839 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:53:05,839 INFO L226 Difference]: Without dead ends: 23 [2022-11-23 13:53:05,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:05,841 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:05,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-23 13:53:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-23 13:53:05,843 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-23 13:53:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-23 13:53:05,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-11-23 13:53:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:05,844 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-23 13:53:05,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-23 13:53:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:53:05,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:05,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:05,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:53:05,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 13:53:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash -443096694, now seen corresponding path program 1 times [2022-11-23 13:53:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:05,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133405461] [2022-11-23 13:53:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:05,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:05,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:53:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:06,005 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:53:06,005 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:53:06,006 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-23 13:53:06,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-23 13:53:06,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-23 13:53:06,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-23 13:53:06,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-23 13:53:06,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:53:06,017 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:06,024 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:53:06,025 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:53:06,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:53:06 BasicIcfg [2022-11-23 13:53:06,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:53:06,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:53:06,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:53:06,126 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:53:06,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:56" (3/4) ... [2022-11-23 13:53:06,129 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 13:53:06,243 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 13:53:06,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:53:06,244 INFO L158 Benchmark]: Toolchain (without parser) took 11968.67ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 120.0MB in the beginning and 169.6MB in the end (delta: -49.7MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2022-11-23 13:53:06,244 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 153.1MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:06,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.42ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 97.7MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:06,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.57ms. Allocated memory is still 153.1MB. Free memory was 97.7MB in the beginning and 95.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:06,246 INFO L158 Benchmark]: Boogie Preprocessor took 80.31ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:06,246 INFO L158 Benchmark]: RCFGBuilder took 1006.45ms. Allocated memory is still 153.1MB. Free memory was 93.3MB in the beginning and 64.2MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-23 13:53:06,247 INFO L158 Benchmark]: TraceAbstraction took 9991.35ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 63.6MB in the beginning and 177.0MB in the end (delta: -113.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:06,248 INFO L158 Benchmark]: Witness Printer took 117.41ms. Allocated memory is still 230.7MB. Free memory was 177.0MB in the beginning and 169.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 13:53:06,251 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.41ms. Allocated memory is still 153.1MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.42ms. Allocated memory is still 153.1MB. Free memory was 119.7MB in the beginning and 97.7MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.57ms. Allocated memory is still 153.1MB. Free memory was 97.7MB in the beginning and 95.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.31ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1006.45ms. Allocated memory is still 153.1MB. Free memory was 93.3MB in the beginning and 64.2MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9991.35ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 63.6MB in the beginning and 177.0MB in the end (delta: -113.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 117.41ms. Allocated memory is still 230.7MB. Free memory was 177.0MB in the beginning and 169.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 102 PlacesBefore, 27 PlacesAfterwards, 97 TransitionsBefore, 21 TransitionsAfterwards, 1196 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 3314 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1618, independent: 1467, independent conditional: 0, independent unconditional: 1467, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 922, independent: 869, independent conditional: 0, independent unconditional: 869, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 922, independent: 850, independent conditional: 0, independent unconditional: 850, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 463, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1618, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 922, unknown conditional: 0, unknown unconditional: 922] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=-2, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=-1, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, __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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=65, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 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. - UnprovableResult [Line: 814]: 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, 116 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 22 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 39, 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, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 13:53:06,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a88ec95-956d-4771-8cb5-ce91200d0033/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE