./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS --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 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b --- 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-8393723 [2022-11-19 08:04:07,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:04:07,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:04:07,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:04:07,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:04:07,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:04:07,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:04:07,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:04:07,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:04:07,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:04:07,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:04:07,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:04:07,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:04:07,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:04:07,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:04:07,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:04:07,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:04:07,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:04:07,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:04:07,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:04:07,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:04:07,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:04:07,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:04:07,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:04:07,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:04:07,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:04:07,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:04:07,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:04:07,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:04:07,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:04:07,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:04:07,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:04:07,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:04:07,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:04:07,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:04:07,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:04:07,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:04:07,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:04:07,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:04:07,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:04:07,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:04:07,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 08:04:07,517 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:04:07,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:04:07,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:04:07,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:04:07,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:04:07,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:04:07,519 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:04:07,519 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:04:07,519 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:04:07,520 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:04:07,520 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:04:07,520 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:04:07,520 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:04:07,520 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:04:07,521 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:04:07,521 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:04:07,521 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:04:07,521 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:04:07,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:04:07,522 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:04:07,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:04:07,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:04:07,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:04:07,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:04:07,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:04:07,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:04:07,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:04:07,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:04:07,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:04:07,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:04:07,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:04:07,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:04:07,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:04:07,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:04:07,534 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:04:07,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:04:07,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:04:07,536 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:04:07,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:04:07,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:04:07,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:04:07,537 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_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/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_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS 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 -> 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b [2022-11-19 08:04:07,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:04:07,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:04:07,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:04:07,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:04:07,851 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:04:07,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-11-19 08:04:07,943 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/data/b7887ce57/a9c7e202a58540719c7126394e66fa8e/FLAGe751a9ee8 [2022-11-19 08:04:08,588 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:04:08,589 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-11-19 08:04:08,603 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/data/b7887ce57/a9c7e202a58540719c7126394e66fa8e/FLAGe751a9ee8 [2022-11-19 08:04:08,869 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/data/b7887ce57/a9c7e202a58540719c7126394e66fa8e [2022-11-19 08:04:08,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:04:08,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:04:08,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:04:08,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:04:08,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:04:08,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:08" (1/1) ... [2022-11-19 08:04:08,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2718a527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:08, skipping insertion in model container [2022-11-19 08:04:08,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:08" (1/1) ... [2022-11-19 08:04:08,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:04:08,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:04:09,160 WARN L234 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_8fd4f222-14d2-4e05-9812-0614e0fee6b6/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2022-11-19 08:04:09,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:04:09,373 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:04:09,392 WARN L234 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_8fd4f222-14d2-4e05-9812-0614e0fee6b6/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2022-11-19 08:04:09,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:04:09,500 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:04:09,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09 WrapperNode [2022-11-19 08:04:09,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:04:09,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:04:09,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:04:09,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:04:09,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,548 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-11-19 08:04:09,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:04:09,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:04:09,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:04:09,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:04:09,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,574 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:04:09,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:04:09,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:04:09,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:04:09,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (1/1) ... [2022-11-19 08:04:09,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:04:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:04:09,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:04:09,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:04:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:04:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:04:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:04:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:04:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:04:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 08:04:09,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 08:04:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 08:04:09,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 08:04:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 08:04:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 08:04:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:04:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:04:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:04:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:04:09,694 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:04:09,834 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:04:09,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:04:10,239 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:04:10,414 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:04:10,418 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:04:10,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:10 BoogieIcfgContainer [2022-11-19 08:04:10,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:04:10,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:04:10,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:04:10,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:04:10,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:04:08" (1/3) ... [2022-11-19 08:04:10,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a91707d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:10, skipping insertion in model container [2022-11-19 08:04:10,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:09" (2/3) ... [2022-11-19 08:04:10,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a91707d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:10, skipping insertion in model container [2022-11-19 08:04:10,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:10" (3/3) ... [2022-11-19 08:04:10,434 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-11-19 08:04:10,443 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 08:04:10,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:04:10,455 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 08:04:10,456 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:04:10,550 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:04:10,601 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:04:10,618 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 251 flow [2022-11-19 08:04:10,622 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 251 flow [2022-11-19 08:04:10,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-11-19 08:04:10,710 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-19 08:04:10,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:04:10,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-19 08:04:10,719 INFO L119 LiptonReduction]: Number of co-enabled transitions 2016 [2022-11-19 08:04:15,800 INFO L134 LiptonReduction]: Checked pairs total: 4679 [2022-11-19 08:04:15,800 INFO L136 LiptonReduction]: Total number of compositions: 106 [2022-11-19 08:04:15,808 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2022-11-19 08:04:15,912 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 522 states, 519 states have (on average 3.113680154142582) internal successors, (1616), 521 states have internal predecessors, (1616), 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-19 08:04:15,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:04:15,944 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;@284d68b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:04:15,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 08:04:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 522 states, 519 states have (on average 3.113680154142582) internal successors, (1616), 521 states have internal predecessors, (1616), 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-19 08:04:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:04:15,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:15,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:15,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1501549893, now seen corresponding path program 1 times [2022-11-19 08:04:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129919254] [2022-11-19 08:04:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:16,554 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-19 08:04:16,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:16,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129919254] [2022-11-19 08:04:16,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129919254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:16,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:16,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:04:16,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473259190] [2022-11-19 08:04:16,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:04:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:04:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:04:16,598 INFO L87 Difference]: Start difference. First operand has 522 states, 519 states have (on average 3.113680154142582) internal successors, (1616), 521 states have internal predecessors, (1616), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:16,722 INFO L93 Difference]: Finished difference Result 442 states and 1320 transitions. [2022-11-19 08:04:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:04:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 08:04:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:16,774 INFO L225 Difference]: With dead ends: 442 [2022-11-19 08:04:16,780 INFO L226 Difference]: Without dead ends: 426 [2022-11-19 08:04:16,782 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-19 08:04:16,787 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:16,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-19 08:04:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-11-19 08:04:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.011764705882353) internal successors, (1280), 425 states have internal predecessors, (1280), 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-19 08:04:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1280 transitions. [2022-11-19 08:04:16,879 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1280 transitions. Word has length 7 [2022-11-19 08:04:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:16,880 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 1280 transitions. [2022-11-19 08:04:16,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1280 transitions. [2022-11-19 08:04:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:04:16,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:16,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:16,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:04:16,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash -119475019, now seen corresponding path program 1 times [2022-11-19 08:04:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:16,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665183882] [2022-11-19 08:04:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:17,142 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-19 08:04:17,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665183882] [2022-11-19 08:04:17,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665183882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:17,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:17,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:04:17,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399490151] [2022-11-19 08:04:17,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:17,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:04:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:17,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:04:17,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:04:17,146 INFO L87 Difference]: Start difference. First operand 426 states and 1280 transitions. 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-19 08:04:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:17,219 INFO L93 Difference]: Finished difference Result 394 states and 1168 transitions. [2022-11-19 08:04:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:04:17,222 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-19 08:04:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:17,228 INFO L225 Difference]: With dead ends: 394 [2022-11-19 08:04:17,228 INFO L226 Difference]: Without dead ends: 394 [2022-11-19 08:04:17,228 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-19 08:04:17,229 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:17,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-19 08:04:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-11-19 08:04:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.9720101781170483) internal successors, (1168), 393 states have internal predecessors, (1168), 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-19 08:04:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1168 transitions. [2022-11-19 08:04:17,266 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1168 transitions. Word has length 9 [2022-11-19 08:04:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:17,267 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 1168 transitions. [2022-11-19 08:04:17,267 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-19 08:04:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1168 transitions. [2022-11-19 08:04:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:04:17,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:17,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:17,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:04:17,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1146138478, now seen corresponding path program 1 times [2022-11-19 08:04:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:17,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131948674] [2022-11-19 08:04:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:17,545 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-19 08:04:17,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:17,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131948674] [2022-11-19 08:04:17,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131948674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:17,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:17,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:04:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034318249] [2022-11-19 08:04:17,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:17,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:04:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:04:17,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:04:17,549 INFO L87 Difference]: Start difference. First operand 394 states and 1168 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:17,680 INFO L93 Difference]: Finished difference Result 373 states and 969 transitions. [2022-11-19 08:04:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:04:17,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 08:04:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:17,683 INFO L225 Difference]: With dead ends: 373 [2022-11-19 08:04:17,684 INFO L226 Difference]: Without dead ends: 277 [2022-11-19 08:04:17,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:04:17,688 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:17,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-19 08:04:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-11-19 08:04:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.536231884057971) internal successors, (700), 276 states have internal predecessors, (700), 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-19 08:04:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 700 transitions. [2022-11-19 08:04:17,708 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 700 transitions. Word has length 11 [2022-11-19 08:04:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 700 transitions. [2022-11-19 08:04:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 700 transitions. [2022-11-19 08:04:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:04:17,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:17,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:17,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:04:17,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1525666975, now seen corresponding path program 1 times [2022-11-19 08:04:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:17,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777764386] [2022-11-19 08:04:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:18,006 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-19 08:04:18,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777764386] [2022-11-19 08:04:18,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777764386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:18,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:18,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:04:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726469076] [2022-11-19 08:04:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:18,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:04:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:04:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:04:18,015 INFO L87 Difference]: Start difference. First operand 277 states and 700 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:18,159 INFO L93 Difference]: Finished difference Result 223 states and 513 transitions. [2022-11-19 08:04:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:04:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:04:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:18,161 INFO L225 Difference]: With dead ends: 223 [2022-11-19 08:04:18,161 INFO L226 Difference]: Without dead ends: 172 [2022-11-19 08:04:18,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:04:18,162 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:18,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 14 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-19 08:04:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-11-19 08:04:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.2514619883040936) internal successors, (385), 171 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 385 transitions. [2022-11-19 08:04:18,168 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 385 transitions. Word has length 14 [2022-11-19 08:04:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:18,168 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 385 transitions. [2022-11-19 08:04:18,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 385 transitions. [2022-11-19 08:04:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:04:18,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:18,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:18,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:04:18,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 540108102, now seen corresponding path program 1 times [2022-11-19 08:04:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:18,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850345630] [2022-11-19 08:04:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:18,419 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-19 08:04:18,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850345630] [2022-11-19 08:04:18,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850345630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:18,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:04:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461425688] [2022-11-19 08:04:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:18,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:04:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:04:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:04:18,427 INFO L87 Difference]: Start difference. First operand 172 states and 385 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:18,592 INFO L93 Difference]: Finished difference Result 240 states and 518 transitions. [2022-11-19 08:04:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:04:18,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:04:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:18,594 INFO L225 Difference]: With dead ends: 240 [2022-11-19 08:04:18,594 INFO L226 Difference]: Without dead ends: 174 [2022-11-19 08:04:18,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:04:18,595 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:18,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 5 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-19 08:04:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-11-19 08:04:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.0994152046783627) internal successors, (359), 171 states have internal predecessors, (359), 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-19 08:04:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 359 transitions. [2022-11-19 08:04:18,601 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 359 transitions. Word has length 17 [2022-11-19 08:04:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:18,602 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 359 transitions. [2022-11-19 08:04:18,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 359 transitions. [2022-11-19 08:04:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:04:18,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:18,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:04:18,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:04:18,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2003418618, now seen corresponding path program 2 times [2022-11-19 08:04:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:18,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724175149] [2022-11-19 08:04:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:18,799 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-19 08:04:18,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724175149] [2022-11-19 08:04:18,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724175149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:18,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:18,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:04:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927944969] [2022-11-19 08:04:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:18,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:04:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:04:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:04:18,802 INFO L87 Difference]: Start difference. First operand 172 states and 359 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:18,943 INFO L93 Difference]: Finished difference Result 153 states and 320 transitions. [2022-11-19 08:04:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:04:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:04:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:18,944 INFO L225 Difference]: With dead ends: 153 [2022-11-19 08:04:18,944 INFO L226 Difference]: Without dead ends: 93 [2022-11-19 08:04:18,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:04:18,945 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:18,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-19 08:04:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-19 08:04:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.010869565217391) internal successors, (185), 92 states have internal predecessors, (185), 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-19 08:04:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 185 transitions. [2022-11-19 08:04:18,949 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 185 transitions. Word has length 17 [2022-11-19 08:04:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:18,950 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 185 transitions. [2022-11-19 08:04:18,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:04:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 185 transitions. [2022-11-19 08:04:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:04:18,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:18,951 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] [2022-11-19 08:04:18,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:04:18,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash 835679767, now seen corresponding path program 1 times [2022-11-19 08:04:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:18,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018267597] [2022-11-19 08:04:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:19,185 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-19 08:04:19,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018267597] [2022-11-19 08:04:19,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018267597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:19,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:04:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791331134] [2022-11-19 08:04:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:04:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:04:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:04:19,188 INFO L87 Difference]: Start difference. First operand 93 states and 185 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-19 08:04:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:19,282 INFO L93 Difference]: Finished difference Result 122 states and 238 transitions. [2022-11-19 08:04:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:04:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-19 08:04:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:19,283 INFO L225 Difference]: With dead ends: 122 [2022-11-19 08:04:19,283 INFO L226 Difference]: Without dead ends: 88 [2022-11-19 08:04:19,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:04:19,284 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:19,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-19 08:04:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2022-11-19 08:04:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.875) internal successors, (135), 72 states have internal predecessors, (135), 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-19 08:04:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 135 transitions. [2022-11-19 08:04:19,288 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 135 transitions. Word has length 20 [2022-11-19 08:04:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:19,288 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 135 transitions. [2022-11-19 08:04:19,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-19 08:04:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 135 transitions. [2022-11-19 08:04:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:04:19,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:19,289 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] [2022-11-19 08:04:19,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:04:19,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 559062199, now seen corresponding path program 2 times [2022-11-19 08:04:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:19,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269062124] [2022-11-19 08:04:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:19,499 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-19 08:04:19,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:19,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269062124] [2022-11-19 08:04:19,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269062124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:19,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:19,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:04:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205000155] [2022-11-19 08:04:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:19,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:04:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:04:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:04:19,502 INFO L87 Difference]: Start difference. First operand 73 states and 135 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-19 08:04:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:19,600 INFO L93 Difference]: Finished difference Result 102 states and 188 transitions. [2022-11-19 08:04:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:04:19,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-11-19 08:04:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:19,601 INFO L225 Difference]: With dead ends: 102 [2022-11-19 08:04:19,601 INFO L226 Difference]: Without dead ends: 42 [2022-11-19 08:04:19,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:04:19,602 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:19,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-19 08:04:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-19 08:04:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 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-19 08:04:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2022-11-19 08:04:19,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2022-11-19 08:04:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:19,605 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2022-11-19 08:04:19,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-19 08:04:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2022-11-19 08:04:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:04:19,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:19,606 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] [2022-11-19 08:04:19,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:04:19,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash 372680383, now seen corresponding path program 3 times [2022-11-19 08:04:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:19,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779061515] [2022-11-19 08:04:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:04:20,047 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-19 08:04:20,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:04:20,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779061515] [2022-11-19 08:04:20,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779061515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:04:20,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:04:20,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:04:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536396574] [2022-11-19 08:04:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:04:20,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:04:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:04:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:04:20,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:04:20,049 INFO L87 Difference]: Start difference. First operand 42 states and 68 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-19 08:04:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:04:20,152 INFO L93 Difference]: Finished difference Result 52 states and 82 transitions. [2022-11-19 08:04:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:04:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-11-19 08:04:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:04:20,153 INFO L225 Difference]: With dead ends: 52 [2022-11-19 08:04:20,153 INFO L226 Difference]: Without dead ends: 30 [2022-11-19 08:04:20,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:04:20,154 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:04:20,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:04:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-19 08:04:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-19 08:04:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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-19 08:04:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-11-19 08:04:20,157 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-11-19 08:04:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:04:20,157 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-11-19 08:04:20,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-19 08:04:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-11-19 08:04:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:04:20,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:04:20,158 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] [2022-11-19 08:04:20,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:04:20,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 08:04:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:04:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 197653439, now seen corresponding path program 4 times [2022-11-19 08:04:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:04:20,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631207260] [2022-11-19 08:04:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:04:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:04:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:04:20,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:04:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:04:20,246 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:04:20,246 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:04:20,247 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-19 08:04:20,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-19 08:04:20,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-19 08:04:20,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-19 08:04:20,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-19 08:04:20,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-19 08:04:20,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:04:20,252 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-19 08:04:20,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:04:20,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:04:20,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:04:20 BasicIcfg [2022-11-19 08:04:20,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:04:20,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:04:20,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:04:20,328 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:04:20,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:10" (3/4) ... [2022-11-19 08:04:20,330 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 08:04:20,450 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 08:04:20,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:04:20,450 INFO L158 Benchmark]: Toolchain (without parser) took 11576.96ms. Allocated memory was 130.0MB in the beginning and 234.9MB in the end (delta: 104.9MB). Free memory was 94.0MB in the beginning and 84.0MB in the end (delta: 10.0MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,451 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 79.7MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:04:20,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.75ms. Allocated memory is still 130.0MB. Free memory was 93.7MB in the beginning and 92.3MB in the end (delta: 1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.48ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,452 INFO L158 Benchmark]: Boogie Preprocessor took 29.55ms. Allocated memory is still 130.0MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,452 INFO L158 Benchmark]: RCFGBuilder took 842.39ms. Allocated memory is still 130.0MB. Free memory was 87.7MB in the beginning and 57.7MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,453 INFO L158 Benchmark]: TraceAbstraction took 9900.74ms. Allocated memory was 130.0MB in the beginning and 234.9MB in the end (delta: 104.9MB). Free memory was 57.0MB in the beginning and 94.5MB in the end (delta: -37.5MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,454 INFO L158 Benchmark]: Witness Printer took 122.55ms. Allocated memory is still 234.9MB. Free memory was 94.5MB in the beginning and 84.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:04:20,456 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 79.7MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.75ms. Allocated memory is still 130.0MB. Free memory was 93.7MB in the beginning and 92.3MB in the end (delta: 1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.48ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.55ms. Allocated memory is still 130.0MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 842.39ms. Allocated memory is still 130.0MB. Free memory was 87.7MB in the beginning and 57.7MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9900.74ms. Allocated memory was 130.0MB in the beginning and 234.9MB in the end (delta: 104.9MB). Free memory was 57.0MB in the beginning and 94.5MB in the end (delta: -37.5MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * Witness Printer took 122.55ms. Allocated memory is still 234.9MB. Free memory was 94.5MB in the beginning and 84.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 126 PlacesBefore, 35 PlacesAfterwards, 118 TransitionsBefore, 26 TransitionsAfterwards, 2016 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 4679 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2530, independent: 2368, independent conditional: 0, independent unconditional: 2368, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1452, independent: 1399, independent conditional: 0, independent unconditional: 1399, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1452, independent: 1384, independent conditional: 0, independent unconditional: 1384, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 455, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2530, independent: 969, independent conditional: 0, independent unconditional: 969, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1452, unknown conditional: 0, unknown unconditional: 1452] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L717] 0 int __unbuffered_p2_EBX = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L738] 0 int y$w_buff0; [L740] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L727] 0 int y$mem_tmp; [L713] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L736] 0 _Bool y$read_delayed; [L719] 0 int a = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L709] 0 int __unbuffered_cnt = 0; [L726] 0 _Bool y$flush_delayed; [L741] 0 _Bool y$w_buff1_used; [L721] 0 _Bool main$tmp_guard1; [L720] 0 _Bool main$tmp_guard0; [L737] 0 int *y$read_delayed_var; [L739] 0 _Bool y$w_buff0_used; [L723] 0 int x = 0; [L732] 0 _Bool y$r_buff1_thd0; [L725] 0 int y = 0; [L734] 0 _Bool y$r_buff1_thd2; [L743] 0 int z = 0; [L733] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd3; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 840]: 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 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 625 IncrementalHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 27 mSDtfsCounter, 625 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 08:04:20,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fd4f222-14d2-4e05-9812-0614e0fee6b6/bin/utaipan-I9t0OCRTmS/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