./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba --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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- 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-b5237d8 [2022-11-22 01:54:29,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:54:29,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:54:29,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:54:29,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:54:29,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:54:29,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:54:29,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:54:29,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:54:29,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:54:29,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:54:29,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:54:29,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:54:29,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:54:29,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:54:29,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:54:29,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:54:29,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:54:29,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:54:29,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:54:29,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:54:29,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:54:29,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:54:29,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:54:29,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:54:29,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:54:29,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:54:29,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:54:29,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:54:29,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:54:29,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:54:29,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:54:29,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:54:29,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:54:29,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:54:29,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:54:29,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:54:29,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:54:29,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:54:29,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:54:29,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:54:29,493 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:54:29,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:54:29,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:54:29,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:54:29,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:54:29,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:54:29,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:54:29,543 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:54:29,543 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:54:29,543 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:54:29,543 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:54:29,545 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:54:29,545 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:54:29,545 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:54:29,545 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:54:29,545 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:54:29,546 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:54:29,546 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:54:29,546 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:54:29,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:54:29,547 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:54:29,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:54:29,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:54:29,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:54:29,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:54:29,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:54:29,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:54:29,549 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:54:29,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:54:29,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:54:29,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:54:29,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:54:29,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:54:29,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:54:29,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:54:29,551 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:54:29,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:54:29,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:54:29,552 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:54:29,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:54:29,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:54:29,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:54:29,553 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_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/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_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba 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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2022-11-22 01:54:29,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:54:29,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:54:29,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:54:29,827 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:54:29,828 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:54:29,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:54:32,924 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:54:33,195 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:54:33,196 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:54:33,210 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/data/d01cb4c94/df27ee53af254660b207c50cb4446c01/FLAG040da6a2e [2022-11-22 01:54:33,227 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/data/d01cb4c94/df27ee53af254660b207c50cb4446c01 [2022-11-22 01:54:33,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:54:33,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:54:33,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:54:33,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:54:33,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:54:33,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:33,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576dee07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33, skipping insertion in model container [2022-11-22 01:54:33,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:33,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:54:33,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:54:33,483 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_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-22 01:54:33,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:54:33,773 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:54:33,792 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_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-22 01:54:33,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:54:33,899 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:54:33,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33 WrapperNode [2022-11-22 01:54:33,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:54:33,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:54:33,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:54:33,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:54:33,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:33,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,008 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-11-22 01:54:34,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:54:34,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:54:34,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:54:34,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:54:34,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,070 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:54:34,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:54:34,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:54:34,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:54:34,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (1/1) ... [2022-11-22 01:54:34,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:54:34,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:34,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:54:34,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:54:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:54:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 01:54:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:54:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:54:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:54:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 01:54:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 01:54:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 01:54:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 01:54:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:54:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 01:54:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:54:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:54:34,181 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:54:34,332 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:54:34,334 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:54:34,681 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:54:34,896 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:54:34,896 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:54:34,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:54:34 BoogieIcfgContainer [2022-11-22 01:54:34,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:54:34,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:54:34,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:54:34,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:54:34,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:54:33" (1/3) ... [2022-11-22 01:54:34,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234f4d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:54:34, skipping insertion in model container [2022-11-22 01:54:34,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:54:33" (2/3) ... [2022-11-22 01:54:34,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234f4d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:54:34, skipping insertion in model container [2022-11-22 01:54:34,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:54:34" (3/3) ... [2022-11-22 01:54:34,908 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:54:34,917 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:54:34,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:54:34,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 01:54:34,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:54:34,978 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:54:35,012 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:54:35,035 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-22 01:54:35,044 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-22 01:54:35,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-22 01:54:35,119 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-22 01:54:35,120 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:54:35,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-22 01:54:35,126 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2022-11-22 01:54:39,917 INFO L134 LiptonReduction]: Checked pairs total: 3337 [2022-11-22 01:54:39,917 INFO L136 LiptonReduction]: Total number of compositions: 91 [2022-11-22 01:54:39,925 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2022-11-22 01:54:39,974 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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-22 01:54:40,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:54:40,015 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;@20d61909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:54:40,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-22 01:54:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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-22 01:54:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:54:40,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:40,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:54:40,028 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-22 01:54:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 417097699, now seen corresponding path program 1 times [2022-11-22 01:54:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667534579] [2022-11-22 01:54:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:40,570 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-22 01:54:40,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667534579] [2022-11-22 01:54:40,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667534579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:40,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:54:40,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979094904] [2022-11-22 01:54:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:40,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:54:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:40,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:54:40,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:54:40,605 INFO L87 Difference]: Start difference. First operand has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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-22 01:54:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:40,720 INFO L93 Difference]: Finished difference Result 167 states and 394 transitions. [2022-11-22 01:54:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:54:40,723 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-22 01:54:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:40,739 INFO L225 Difference]: With dead ends: 167 [2022-11-22 01:54:40,739 INFO L226 Difference]: Without dead ends: 162 [2022-11-22 01:54:40,740 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-22 01:54:40,747 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:40,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-22 01:54:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-22 01:54:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.391304347826087) internal successors, (385), 161 states have internal predecessors, (385), 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-22 01:54:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2022-11-22 01:54:40,818 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2022-11-22 01:54:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:40,819 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2022-11-22 01:54:40,819 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-22 01:54:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2022-11-22 01:54:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:54:40,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:40,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:40,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:54:40,824 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-22 01:54:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 418890694, now seen corresponding path program 1 times [2022-11-22 01:54:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:40,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135826699] [2022-11-22 01:54:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:54:41,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:41,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135826699] [2022-11-22 01:54:41,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135826699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:41,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:41,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:54:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133860447] [2022-11-22 01:54:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:41,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:54:41,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:41,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:54:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:54:41,632 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-22 01:54:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:41,830 INFO L93 Difference]: Finished difference Result 172 states and 388 transitions. [2022-11-22 01:54:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:54:41,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-22 01:54:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:41,832 INFO L225 Difference]: With dead ends: 172 [2022-11-22 01:54:41,833 INFO L226 Difference]: Without dead ends: 142 [2022-11-22 01:54:41,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:54:41,834 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:41,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 13 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:54:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-22 01:54:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-22 01:54:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.3333333333333335) internal successors, (329), 141 states have internal predecessors, (329), 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-22 01:54:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2022-11-22 01:54:41,845 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 8 [2022-11-22 01:54:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:41,846 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2022-11-22 01:54:41,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-22 01:54:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2022-11-22 01:54:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:54:41,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:41,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:41,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:54:41,848 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-22 01:54:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1162641788, now seen corresponding path program 1 times [2022-11-22 01:54:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:41,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034316543] [2022-11-22 01:54:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:42,602 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-22 01:54:42,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:42,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034316543] [2022-11-22 01:54:42,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034316543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:42,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:42,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:54:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572317682] [2022-11-22 01:54:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:42,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:54:42,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:54:42,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:54:42,609 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:42,760 INFO L93 Difference]: Finished difference Result 154 states and 340 transitions. [2022-11-22 01:54:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:54:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:54:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:42,762 INFO L225 Difference]: With dead ends: 154 [2022-11-22 01:54:42,762 INFO L226 Difference]: Without dead ends: 134 [2022-11-22 01:54:42,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:54:42,764 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:42,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-22 01:54:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-22 01:54:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.293233082706767) internal successors, (305), 133 states have internal predecessors, (305), 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-22 01:54:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 305 transitions. [2022-11-22 01:54:42,773 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 305 transitions. Word has length 10 [2022-11-22 01:54:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:42,774 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 305 transitions. [2022-11-22 01:54:42,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 305 transitions. [2022-11-22 01:54:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:54:42,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:42,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:42,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:54:42,776 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-22 01:54:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1669856922, now seen corresponding path program 1 times [2022-11-22 01:54:42,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:42,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047756410] [2022-11-22 01:54:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:42,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:43,478 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-22 01:54:43,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:43,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047756410] [2022-11-22 01:54:43,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047756410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:43,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:43,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:54:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856515342] [2022-11-22 01:54:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:43,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:54:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:54:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:54:43,481 INFO L87 Difference]: Start difference. First operand 134 states and 305 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 01:54:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:43,767 INFO L93 Difference]: Finished difference Result 177 states and 397 transitions. [2022-11-22 01:54:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:54:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 01:54:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:43,770 INFO L225 Difference]: With dead ends: 177 [2022-11-22 01:54:43,770 INFO L226 Difference]: Without dead ends: 161 [2022-11-22 01:54:43,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:54:43,771 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:43,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:54:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-22 01:54:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-11-22 01:54:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.3) internal successors, (368), 160 states have internal predecessors, (368), 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-22 01:54:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 368 transitions. [2022-11-22 01:54:43,782 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 368 transitions. Word has length 12 [2022-11-22 01:54:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:43,783 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 368 transitions. [2022-11-22 01:54:43,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 01:54:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 368 transitions. [2022-11-22 01:54:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:54:43,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:43,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:54:43,785 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-22 01:54:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1585662736, now seen corresponding path program 2 times [2022-11-22 01:54:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:43,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933668166] [2022-11-22 01:54:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:44,216 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-22 01:54:44,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:44,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933668166] [2022-11-22 01:54:44,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933668166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:44,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:54:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178972646] [2022-11-22 01:54:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:44,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:54:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:44,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:54:44,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:54:44,230 INFO L87 Difference]: Start difference. First operand 161 states and 368 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-22 01:54:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:44,388 INFO L93 Difference]: Finished difference Result 190 states and 424 transitions. [2022-11-22 01:54:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:54:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-22 01:54:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:44,390 INFO L225 Difference]: With dead ends: 190 [2022-11-22 01:54:44,390 INFO L226 Difference]: Without dead ends: 178 [2022-11-22 01:54:44,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:54:44,391 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:44,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 20 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-22 01:54:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 163. [2022-11-22 01:54:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.2901234567901234) internal successors, (371), 162 states have internal predecessors, (371), 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-22 01:54:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 371 transitions. [2022-11-22 01:54:44,406 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 371 transitions. Word has length 12 [2022-11-22 01:54:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:44,406 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 371 transitions. [2022-11-22 01:54:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-22 01:54:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 371 transitions. [2022-11-22 01:54:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:54:44,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:44,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:44,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:54:44,409 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-22 01:54:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1587334876, now seen corresponding path program 3 times [2022-11-22 01:54:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:44,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114594938] [2022-11-22 01:54:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:45,337 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-22 01:54:45,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114594938] [2022-11-22 01:54:45,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114594938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:45,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:54:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987939625] [2022-11-22 01:54:45,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:45,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:54:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:54:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:54:45,340 INFO L87 Difference]: Start difference. First operand 163 states and 371 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 01:54:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:45,546 INFO L93 Difference]: Finished difference Result 186 states and 410 transitions. [2022-11-22 01:54:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:54:45,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 01:54:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:45,549 INFO L225 Difference]: With dead ends: 186 [2022-11-22 01:54:45,549 INFO L226 Difference]: Without dead ends: 172 [2022-11-22 01:54:45,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:54:45,550 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:45,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 23 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:54:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-22 01:54:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2022-11-22 01:54:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.2549019607843137) internal successors, (345), 153 states have internal predecessors, (345), 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-22 01:54:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 345 transitions. [2022-11-22 01:54:45,562 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 345 transitions. Word has length 12 [2022-11-22 01:54:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:45,563 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 345 transitions. [2022-11-22 01:54:45,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 01:54:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 345 transitions. [2022-11-22 01:54:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:54:45,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:45,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:45,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:54:45,565 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-22 01:54:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -651854395, now seen corresponding path program 1 times [2022-11-22 01:54:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:45,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671664025] [2022-11-22 01:54:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:45,787 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-22 01:54:45,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671664025] [2022-11-22 01:54:45,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671664025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:45,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:45,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:54:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141055383] [2022-11-22 01:54:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:45,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:54:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:45,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:54:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:54:45,791 INFO L87 Difference]: Start difference. First operand 154 states and 345 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-22 01:54:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:45,889 INFO L93 Difference]: Finished difference Result 132 states and 250 transitions. [2022-11-22 01:54:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:54:45,890 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-22 01:54:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:45,891 INFO L225 Difference]: With dead ends: 132 [2022-11-22 01:54:45,891 INFO L226 Difference]: Without dead ends: 94 [2022-11-22 01:54:45,891 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-22 01:54:45,892 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:45,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-22 01:54:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-22 01:54:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7741935483870968) internal successors, (165), 93 states have internal predecessors, (165), 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-22 01:54:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 165 transitions. [2022-11-22 01:54:45,897 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 165 transitions. Word has length 12 [2022-11-22 01:54:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:45,898 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 165 transitions. [2022-11-22 01:54:45,898 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-22 01:54:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-11-22 01:54:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:54:45,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:45,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:45,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:54:45,900 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-22 01:54:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -90065576, now seen corresponding path program 1 times [2022-11-22 01:54:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831575971] [2022-11-22 01:54:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:46,073 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-22 01:54:46,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831575971] [2022-11-22 01:54:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831575971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:54:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277892873] [2022-11-22 01:54:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:46,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:54:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:54:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:54:46,079 INFO L87 Difference]: Start difference. First operand 94 states and 165 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:46,173 INFO L93 Difference]: Finished difference Result 68 states and 111 transitions. [2022-11-22 01:54:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:54:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:54:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:46,174 INFO L225 Difference]: With dead ends: 68 [2022-11-22 01:54:46,175 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 01:54:46,175 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-22 01:54:46,176 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:46,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 01:54:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2022-11-22 01:54:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 45 states have internal predecessors, (73), 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-22 01:54:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2022-11-22 01:54:46,178 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 13 [2022-11-22 01:54:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:46,179 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2022-11-22 01:54:46,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2022-11-22 01:54:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:54:46,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:46,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:46,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:54:46,180 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-22 01:54:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1384601683, now seen corresponding path program 1 times [2022-11-22 01:54:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002892644] [2022-11-22 01:54:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:46,425 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-22 01:54:46,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:46,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002892644] [2022-11-22 01:54:46,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002892644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:46,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:46,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:54:46,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562282905] [2022-11-22 01:54:46,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:46,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:54:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:54:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:54:46,428 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:46,523 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-11-22 01:54:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:54:46,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:54:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:46,525 INFO L225 Difference]: With dead ends: 61 [2022-11-22 01:54:46,525 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 01:54:46,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:54:46,526 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:46,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 01:54:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-22 01:54:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-22 01:54:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-22 01:54:46,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2022-11-22 01:54:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:46,529 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-22 01:54:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-22 01:54:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:54:46,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:46,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:46,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:54:46,530 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-22 01:54:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash -339677579, now seen corresponding path program 2 times [2022-11-22 01:54:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:46,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137514998] [2022-11-22 01:54:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:47,608 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-22 01:54:47,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137514998] [2022-11-22 01:54:47,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137514998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:47,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:47,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:54:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563650478] [2022-11-22 01:54:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:54:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:54:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:54:47,610 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:47,813 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-11-22 01:54:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:54:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:54:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:47,814 INFO L225 Difference]: With dead ends: 35 [2022-11-22 01:54:47,814 INFO L226 Difference]: Without dead ends: 22 [2022-11-22 01:54:47,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:54:47,815 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:47,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 9 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:54:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-22 01:54:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-22 01:54:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-11-22 01:54:47,817 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-11-22 01:54:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:47,818 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-11-22 01:54:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-11-22 01:54:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:54:47,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:47,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:54:47,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:54:47,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-22 01:54:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1190346579, now seen corresponding path program 3 times [2022-11-22 01:54:47,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:47,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267353241] [2022-11-22 01:54:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:54:47,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:54:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:54:47,925 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:54:47,939 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:54:47,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-22 01:54:47,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-22 01:54:47,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-22 01:54:47,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-22 01:54:47,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-22 01:54:47,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:54:47,946 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-11-22 01:54:47,952 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:54:47,955 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:54:48,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:54:48 BasicIcfg [2022-11-22 01:54:48,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:54:48,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:54:48,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:54:48,035 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:54:48,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:54:34" (3/4) ... [2022-11-22 01:54:48,037 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:54:48,095 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:54:48,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:54:48,096 INFO L158 Benchmark]: Toolchain (without parser) took 14864.63ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 125.5MB in the beginning and 156.3MB in the end (delta: -30.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2022-11-22 01:54:48,097 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 127.9MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:54:48,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.45ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 102.5MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 01:54:48,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.84ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 99.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:54:48,098 INFO L158 Benchmark]: Boogie Preprocessor took 70.76ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:54:48,098 INFO L158 Benchmark]: RCFGBuilder took 811.83ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 128.0MB in the end (delta: -30.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-11-22 01:54:48,099 INFO L158 Benchmark]: TraceAbstraction took 13132.62ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 128.0MB in the beginning and 164.7MB in the end (delta: -36.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-22 01:54:48,099 INFO L158 Benchmark]: Witness Printer took 61.65ms. Allocated memory is still 245.4MB. Free memory was 164.7MB in the beginning and 156.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-22 01:54:48,101 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.23ms. Allocated memory is still 127.9MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.45ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 102.5MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.84ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 99.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.76ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 811.83ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 128.0MB in the end (delta: -30.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13132.62ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 128.0MB in the beginning and 164.7MB in the end (delta: -36.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 61.65ms. Allocated memory is still 245.4MB. Free memory was 164.7MB in the beginning and 156.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 103 PlacesBefore, 28 PlacesAfterwards, 98 TransitionsBefore, 22 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 3337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1707, independent: 1571, independent conditional: 0, independent unconditional: 1571, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 921, independent: 884, independent conditional: 0, independent unconditional: 884, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 921, independent: 868, independent conditional: 0, independent unconditional: 868, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 390, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1707, independent: 687, independent conditional: 0, independent unconditional: 687, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 921, unknown conditional: 0, unknown unconditional: 921] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=-1, t1091={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, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=0, t1091={5:0}, t1092={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, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 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) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 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 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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, 118 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 745 IncrementalHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 53 mSDtfsCounter, 745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=0, InterpolantAutomatonStates: 58, 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, 10 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 01:54:48,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2c6df4-d9b7-4a29-8c3e-3534cfecfe2d/bin/utaipan-g80aRyZoba/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