./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/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_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/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_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- 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:09:55,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:09:55,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:09:55,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:09:55,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:09:55,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:09:55,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:09:55,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:09:55,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:09:55,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:09:55,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:09:55,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:09:55,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:09:55,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:09:55,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:09:55,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:09:55,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:09:55,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:09:55,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:09:55,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:09:55,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:09:55,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:09:55,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:09:55,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:09:55,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:09:55,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:09:55,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:09:55,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:09:55,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:09:55,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:09:55,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:09:55,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:09:55,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:09:55,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:09:55,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:09:55,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:09:55,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:09:55,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:09:55,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:09:55,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:09:55,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:09:55,500 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:09:55,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:09:55,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:09:55,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:09:55,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:09:55,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:09:55,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:09:55,526 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:09:55,526 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:09:55,526 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:09:55,527 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:09:55,527 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:09:55,527 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:09:55,527 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:09:55,527 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:09:55,527 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:09:55,528 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:09:55,528 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:09:55,528 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:09:55,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:09:55,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:09:55,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:09:55,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:09:55,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:09:55,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:09:55,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:09:55,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:09:55,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:09:55,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:09:55,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:09:55,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:09:55,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:09:55,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:09:55,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:55,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:09:55,531 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:09:55,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:09:55,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:09:55,532 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:09:55,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:09:55,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:09:55,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:09:55,533 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_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/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_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2022-11-22 01:09:55,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:09:55,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:09:55,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:09:55,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:09:55,821 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:09:55,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-22 01:09:59,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:09:59,375 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:09:59,375 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-22 01:09:59,391 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/data/e2c40e480/7406c24181824a85b64af6fe69011b90/FLAGb72db2814 [2022-11-22 01:09:59,408 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/data/e2c40e480/7406c24181824a85b64af6fe69011b90 [2022-11-22 01:09:59,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:09:59,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:09:59,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:59,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:09:59,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:09:59,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:59" (1/1) ... [2022-11-22 01:09:59,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7efdf8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:59, skipping insertion in model container [2022-11-22 01:09:59,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:59" (1/1) ... [2022-11-22 01:09:59,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:09:59,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:09:59,692 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_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-22 01:09:59,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:59,890 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:09:59,913 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_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-22 01:09:59,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:10:00,051 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:10:00,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00 WrapperNode [2022-11-22 01:10:00,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:10:00,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:10:00,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:10:00,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:10:00,063 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:10:00" (1/1) ... [2022-11-22 01:10:00,094 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:10:00" (1/1) ... [2022-11-22 01:10:00,144 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-22 01:10:00,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:10:00,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:10:00,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:10:00,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:10:00,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,200 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:10:00,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:10:00,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:10:00,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:10:00,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (1/1) ... [2022-11-22 01:10:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:10:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:10:00,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:10:00,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:10:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:10:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 01:10:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:10:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:10:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:10:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 01:10:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 01:10:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 01:10:00,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 01:10:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 01:10:00,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 01:10:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-22 01:10:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-22 01:10:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:10:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 01:10:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:10:00,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:10:00,308 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:10:00,547 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:10:00,549 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:10:00,943 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:10:01,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:10:01,112 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:10:01,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:10:01 BoogieIcfgContainer [2022-11-22 01:10:01,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:10:01,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:10:01,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:10:01,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:10:01,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:09:59" (1/3) ... [2022-11-22 01:10:01,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496eb136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:10:01, skipping insertion in model container [2022-11-22 01:10:01,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:10:00" (2/3) ... [2022-11-22 01:10:01,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496eb136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:10:01, skipping insertion in model container [2022-11-22 01:10:01,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:10:01" (3/3) ... [2022-11-22 01:10:01,128 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-22 01:10:01,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:10:01,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:10:01,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 01:10:01,151 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:10:01,249 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:10:01,288 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:10:01,317 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 286 flow [2022-11-22 01:10:01,327 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 286 flow [2022-11-22 01:10:01,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-22 01:10:01,419 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-22 01:10:01,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:10:01,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-22 01:10:01,428 INFO L119 LiptonReduction]: Number of co-enabled transitions 2828 [2022-11-22 01:10:06,452 INFO L134 LiptonReduction]: Checked pairs total: 6722 [2022-11-22 01:10:06,452 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-22 01:10:06,460 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2022-11-22 01:10:06,690 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2218 states, 2215 states have (on average 3.9873589164785552) internal successors, (8832), 2217 states have internal predecessors, (8832), 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:10:06,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:10:06,726 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;@233fa6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:10:06,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-22 01:10:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 2218 states, 2215 states have (on average 3.9873589164785552) internal successors, (8832), 2217 states have internal predecessors, (8832), 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:10:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:10:06,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:06,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:06,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1540565, now seen corresponding path program 1 times [2022-11-22 01:10:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:06,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775772711] [2022-11-22 01:10:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:07,290 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:10:07,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:07,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775772711] [2022-11-22 01:10:07,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775772711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:07,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:07,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:10:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671137451] [2022-11-22 01:10:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:07,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:10:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:07,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:10:07,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:10:07,330 INFO L87 Difference]: Start difference. First operand has 2218 states, 2215 states have (on average 3.9873589164785552) internal successors, (8832), 2217 states have internal predecessors, (8832), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:10:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:07,484 INFO L93 Difference]: Finished difference Result 1834 states and 6880 transitions. [2022-11-22 01:10:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:10:07,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-11-22 01:10:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:07,528 INFO L225 Difference]: With dead ends: 1834 [2022-11-22 01:10:07,528 INFO L226 Difference]: Without dead ends: 1770 [2022-11-22 01:10:07,529 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:10:07,534 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:07,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2022-11-22 01:10:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2022-11-22 01:10:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 3.771622385528547) internal successors, (6672), 1769 states have internal predecessors, (6672), 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:10:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6672 transitions. [2022-11-22 01:10:07,704 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6672 transitions. Word has length 9 [2022-11-22 01:10:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:07,706 INFO L495 AbstractCegarLoop]: Abstraction has 1770 states and 6672 transitions. [2022-11-22 01:10:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:10:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6672 transitions. [2022-11-22 01:10:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:10:07,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:07,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:07,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:10:07,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1351712071, now seen corresponding path program 1 times [2022-11-22 01:10:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:07,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459378646] [2022-11-22 01:10:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:08,071 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:10:08,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:08,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459378646] [2022-11-22 01:10:08,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459378646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:08,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:08,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:10:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807849066] [2022-11-22 01:10:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:08,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:10:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:10:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:10:08,075 INFO L87 Difference]: Start difference. First operand 1770 states and 6672 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:08,294 INFO L93 Difference]: Finished difference Result 3038 states and 10830 transitions. [2022-11-22 01:10:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:10:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:10:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:08,321 INFO L225 Difference]: With dead ends: 3038 [2022-11-22 01:10:08,321 INFO L226 Difference]: Without dead ends: 2494 [2022-11-22 01:10:08,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:10:08,324 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:08,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2022-11-22 01:10:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 2190. [2022-11-22 01:10:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2189 states have (on average 3.6701690269529466) internal successors, (8034), 2189 states have internal predecessors, (8034), 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:10:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 8034 transitions. [2022-11-22 01:10:08,431 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 8034 transitions. Word has length 12 [2022-11-22 01:10:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:08,432 INFO L495 AbstractCegarLoop]: Abstraction has 2190 states and 8034 transitions. [2022-11-22 01:10:08,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 8034 transitions. [2022-11-22 01:10:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:10:08,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:08,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:10:08,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1046626728, now seen corresponding path program 1 times [2022-11-22 01:10:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:08,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619224068] [2022-11-22 01:10:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:08,678 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:10:08,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:08,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619224068] [2022-11-22 01:10:08,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619224068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:08,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:08,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:10:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169489883] [2022-11-22 01:10:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:08,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:10:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:10:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:10:08,682 INFO L87 Difference]: Start difference. First operand 2190 states and 8034 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:10:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:08,768 INFO L93 Difference]: Finished difference Result 1722 states and 5698 transitions. [2022-11-22 01:10:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:10:08,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:10:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:08,780 INFO L225 Difference]: With dead ends: 1722 [2022-11-22 01:10:08,780 INFO L226 Difference]: Without dead ends: 1722 [2022-11-22 01:10:08,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:10:08,784 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:08,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-11-22 01:10:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2022-11-22 01:10:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 3.3108657757117954) internal successors, (5698), 1721 states have internal predecessors, (5698), 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:10:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 5698 transitions. [2022-11-22 01:10:08,858 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 5698 transitions. Word has length 13 [2022-11-22 01:10:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 1722 states and 5698 transitions. [2022-11-22 01:10:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:10:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 5698 transitions. [2022-11-22 01:10:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:10:08,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:08,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:08,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:10:08,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1651474303, now seen corresponding path program 1 times [2022-11-22 01:10:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24007271] [2022-11-22 01:10:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:09,069 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:10:09,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:09,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24007271] [2022-11-22 01:10:09,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24007271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:10:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286569288] [2022-11-22 01:10:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:09,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:10:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:09,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:10:09,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:10:09,077 INFO L87 Difference]: Start difference. First operand 1722 states and 5698 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:09,184 INFO L93 Difference]: Finished difference Result 1074 states and 3116 transitions. [2022-11-22 01:10:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:10:09,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 01:10:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:09,191 INFO L225 Difference]: With dead ends: 1074 [2022-11-22 01:10:09,191 INFO L226 Difference]: Without dead ends: 1074 [2022-11-22 01:10:09,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:10:09,194 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:09,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 9 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-11-22 01:10:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2022-11-22 01:10:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1053 states have (on average 2.8964862298195633) internal successors, (3050), 1053 states have internal predecessors, (3050), 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:10:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 3050 transitions. [2022-11-22 01:10:09,247 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 3050 transitions. Word has length 15 [2022-11-22 01:10:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:09,248 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 3050 transitions. [2022-11-22 01:10:09,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 3050 transitions. [2022-11-22 01:10:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:10:09,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:09,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:09,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:10:09,255 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1443446500, now seen corresponding path program 1 times [2022-11-22 01:10:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942729518] [2022-11-22 01:10:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:09,436 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:10:09,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:09,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942729518] [2022-11-22 01:10:09,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942729518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:09,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:09,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:10:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083703341] [2022-11-22 01:10:09,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:09,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:10:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:10:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:10:09,438 INFO L87 Difference]: Start difference. First operand 1054 states and 3050 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:09,592 INFO L93 Difference]: Finished difference Result 734 states and 2098 transitions. [2022-11-22 01:10:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:10:09,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:10:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:09,597 INFO L225 Difference]: With dead ends: 734 [2022-11-22 01:10:09,597 INFO L226 Difference]: Without dead ends: 734 [2022-11-22 01:10:09,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:10:09,598 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:09,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-11-22 01:10:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 638. [2022-11-22 01:10:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.847723704866562) internal successors, (1814), 637 states have internal predecessors, (1814), 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:10:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1814 transitions. [2022-11-22 01:10:09,619 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1814 transitions. Word has length 18 [2022-11-22 01:10:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:09,619 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1814 transitions. [2022-11-22 01:10:09,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1814 transitions. [2022-11-22 01:10:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:10:09,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:09,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:09,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:10:09,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:09,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:09,623 INFO L85 PathProgramCache]: Analyzing trace with hash 257948418, now seen corresponding path program 1 times [2022-11-22 01:10:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:09,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236312997] [2022-11-22 01:10:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:09,839 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:10:09,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:09,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236312997] [2022-11-22 01:10:09,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236312997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:09,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:09,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:10:09,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825647307] [2022-11-22 01:10:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:09,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:10:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:09,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:10:09,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:10:09,842 INFO L87 Difference]: Start difference. First operand 638 states and 1814 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:09,963 INFO L93 Difference]: Finished difference Result 574 states and 1688 transitions. [2022-11-22 01:10:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:10:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 01:10:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:09,967 INFO L225 Difference]: With dead ends: 574 [2022-11-22 01:10:09,967 INFO L226 Difference]: Without dead ends: 550 [2022-11-22 01:10:09,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:10:09,968 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:09,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 11 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-22 01:10:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 470. [2022-11-22 01:10:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.976545842217484) internal successors, (1396), 469 states have internal predecessors, (1396), 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:10:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1396 transitions. [2022-11-22 01:10:09,994 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1396 transitions. Word has length 21 [2022-11-22 01:10:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:09,995 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1396 transitions. [2022-11-22 01:10:09,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1396 transitions. [2022-11-22 01:10:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:10:09,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:09,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:09,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:10:09,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:09,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1640684702, now seen corresponding path program 1 times [2022-11-22 01:10:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:09,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443718996] [2022-11-22 01:10:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:10,226 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:10:10,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:10,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443718996] [2022-11-22 01:10:10,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443718996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:10,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:10,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:10:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194016880] [2022-11-22 01:10:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:10,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:10:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:10:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:10:10,229 INFO L87 Difference]: Start difference. First operand 470 states and 1396 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:10,400 INFO L93 Difference]: Finished difference Result 717 states and 2079 transitions. [2022-11-22 01:10:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:10:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 01:10:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:10,404 INFO L225 Difference]: With dead ends: 717 [2022-11-22 01:10:10,404 INFO L226 Difference]: Without dead ends: 594 [2022-11-22 01:10:10,404 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:10:10,405 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:10,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-22 01:10:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 406. [2022-11-22 01:10:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.8740740740740742) internal successors, (1164), 405 states have internal predecessors, (1164), 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:10:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1164 transitions. [2022-11-22 01:10:10,420 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1164 transitions. Word has length 25 [2022-11-22 01:10:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:10,420 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 1164 transitions. [2022-11-22 01:10:10,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1164 transitions. [2022-11-22 01:10:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:10:10,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:10,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:10,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:10:10,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash 482818636, now seen corresponding path program 2 times [2022-11-22 01:10:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:10,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18631680] [2022-11-22 01:10:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:10,682 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:10:10,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:10,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18631680] [2022-11-22 01:10:10,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18631680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:10,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:10,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:10:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462533126] [2022-11-22 01:10:10,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:10,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:10:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:10,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:10:10,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:10:10,685 INFO L87 Difference]: Start difference. First operand 406 states and 1164 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:10,889 INFO L93 Difference]: Finished difference Result 693 states and 1939 transitions. [2022-11-22 01:10:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:10:10,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 01:10:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:10,891 INFO L225 Difference]: With dead ends: 693 [2022-11-22 01:10:10,892 INFO L226 Difference]: Without dead ends: 292 [2022-11-22 01:10:10,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:10:10,892 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:10,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 19 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:10:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-22 01:10:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 232. [2022-11-22 01:10:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.6233766233766236) internal successors, (606), 231 states have internal predecessors, (606), 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:10:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 606 transitions. [2022-11-22 01:10:10,901 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 606 transitions. Word has length 25 [2022-11-22 01:10:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:10,901 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 606 transitions. [2022-11-22 01:10:10,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 606 transitions. [2022-11-22 01:10:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:10:10,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:10,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:10,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:10:10,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -936032756, now seen corresponding path program 3 times [2022-11-22 01:10:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116959563] [2022-11-22 01:10:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:11,115 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:10:11,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:11,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116959563] [2022-11-22 01:10:11,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116959563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:11,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:11,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:10:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292712698] [2022-11-22 01:10:11,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:11,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:10:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:10:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:10:11,118 INFO L87 Difference]: Start difference. First operand 232 states and 606 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:11,221 INFO L93 Difference]: Finished difference Result 307 states and 795 transitions. [2022-11-22 01:10:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:10:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 01:10:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:11,222 INFO L225 Difference]: With dead ends: 307 [2022-11-22 01:10:11,222 INFO L226 Difference]: Without dead ends: 146 [2022-11-22 01:10:11,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:10:11,224 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:11,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-22 01:10:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-22 01:10:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.4275862068965517) internal successors, (352), 145 states have internal predecessors, (352), 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:10:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 352 transitions. [2022-11-22 01:10:11,229 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 352 transitions. Word has length 25 [2022-11-22 01:10:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:11,229 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 352 transitions. [2022-11-22 01:10:11,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 352 transitions. [2022-11-22 01:10:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:10:11,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:11,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:11,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:10:11,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -789083188, now seen corresponding path program 4 times [2022-11-22 01:10:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:11,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035339759] [2022-11-22 01:10:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:11,481 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:10:11,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:11,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035339759] [2022-11-22 01:10:11,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035339759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:11,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:11,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:10:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819115245] [2022-11-22 01:10:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:10:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:10:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:10:11,484 INFO L87 Difference]: Start difference. First operand 146 states and 352 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:11,626 INFO L93 Difference]: Finished difference Result 197 states and 471 transitions. [2022-11-22 01:10:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:10:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 01:10:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:11,627 INFO L225 Difference]: With dead ends: 197 [2022-11-22 01:10:11,628 INFO L226 Difference]: Without dead ends: 114 [2022-11-22 01:10:11,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:10:11,629 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:11,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-22 01:10:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-22 01:10:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.257425742574257) internal successors, (228), 101 states have internal predecessors, (228), 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:10:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 228 transitions. [2022-11-22 01:10:11,634 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 228 transitions. Word has length 25 [2022-11-22 01:10:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:11,635 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 228 transitions. [2022-11-22 01:10:11,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 228 transitions. [2022-11-22 01:10:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:10:11,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:11,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:11,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:10:11,637 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash -368245328, now seen corresponding path program 5 times [2022-11-22 01:10:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:11,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965097408] [2022-11-22 01:10:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:11,851 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:10:11,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965097408] [2022-11-22 01:10:11,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965097408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:10:11,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:10:11,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:10:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075214153] [2022-11-22 01:10:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:11,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:10:11,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:11,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:10:11,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:10:11,854 INFO L87 Difference]: Start difference. First operand 102 states and 228 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:12,026 INFO L93 Difference]: Finished difference Result 141 states and 315 transitions. [2022-11-22 01:10:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:10:12,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 01:10:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:12,027 INFO L225 Difference]: With dead ends: 141 [2022-11-22 01:10:12,028 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 01:10:12,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:10:12,028 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:12,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 16 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 01:10:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-22 01:10:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 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:10:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2022-11-22 01:10:12,032 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 25 [2022-11-22 01:10:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:12,032 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 166 transitions. [2022-11-22 01:10:12,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 166 transitions. [2022-11-22 01:10:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:10:12,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:12,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:12,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:10:12,033 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-22 01:10:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1961914512, now seen corresponding path program 6 times [2022-11-22 01:10:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:12,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586433304] [2022-11-22 01:10:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:10:12,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:10:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:10:12,155 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:10:12,155 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:10:12,156 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-22 01:10:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-22 01:10:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-22 01:10:12,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-22 01:10:12,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-22 01:10:12,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-22 01:10:12,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-22 01:10:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:10:12,162 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:12,167 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:10:12,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:10:12,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:10:12 BasicIcfg [2022-11-22 01:10:12,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:10:12,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:10:12,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:10:12,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:10:12,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:10:01" (3/4) ... [2022-11-22 01:10:12,290 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:10:12,434 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:10:12,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:10:12,436 INFO L158 Benchmark]: Toolchain (without parser) took 13006.37ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 150.3MB in the beginning and 223.8MB in the end (delta: -73.6MB). Peak memory consumption was 179.1MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,436 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 115.3MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:10:12,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.82ms. Allocated memory is still 182.5MB. Free memory was 150.3MB in the beginning and 127.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.10ms. Allocated memory is still 182.5MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,437 INFO L158 Benchmark]: Boogie Preprocessor took 66.07ms. Allocated memory is still 182.5MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,438 INFO L158 Benchmark]: RCFGBuilder took 905.54ms. Allocated memory is still 182.5MB. Free memory was 122.0MB in the beginning and 90.6MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,439 INFO L158 Benchmark]: TraceAbstraction took 11166.49ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 89.6MB in the beginning and 78.1MB in the end (delta: 11.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,439 INFO L158 Benchmark]: Witness Printer took 147.29ms. Allocated memory is still 272.6MB. Free memory was 78.1MB in the beginning and 223.8MB in the end (delta: -145.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 01:10:12,441 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.26ms. Allocated memory is still 115.3MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.82ms. Allocated memory is still 182.5MB. Free memory was 150.3MB in the beginning and 127.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.10ms. Allocated memory is still 182.5MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.07ms. Allocated memory is still 182.5MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 905.54ms. Allocated memory is still 182.5MB. Free memory was 122.0MB in the beginning and 90.6MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11166.49ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 89.6MB in the beginning and 78.1MB in the end (delta: 11.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. * Witness Printer took 147.29ms. Allocated memory is still 272.6MB. Free memory was 78.1MB in the beginning and 223.8MB in the end (delta: -145.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 144 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 32 TransitionsAfterwards, 2828 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 6722 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4050, independent: 3879, independent conditional: 0, independent unconditional: 3879, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2099, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2099, independent: 2027, independent conditional: 0, independent unconditional: 2027, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 352, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 293, dependent conditional: 0, dependent unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4050, independent: 1827, independent conditional: 0, independent unconditional: 1827, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 2099, unknown conditional: 0, unknown unconditional: 2099] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-2, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=1, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 853]: 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: 847]: 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: 851]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 49 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2218occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 760 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:10:12,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9ebf9-0fe2-4ff8-a0c7-8bd93733017b/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