./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:15:25,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:15:25,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:15:25,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:15:25,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:15:25,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:15:25,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:15:25,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:15:25,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:15:25,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:15:25,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:15:25,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:15:25,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:15:25,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:15:25,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:15:25,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:15:25,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:15:25,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:15:25,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:15:25,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:15:25,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:15:25,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:15:25,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:15:25,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:15:25,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:15:25,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:15:25,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:15:25,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:15:25,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:15:25,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:15:25,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:15:25,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:15:25,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:15:25,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:15:25,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:15:25,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:15:25,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:15:25,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:15:25,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:15:25,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:15:25,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:15:25,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 00:15:25,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:15:25,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:15:25,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:15:25,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:15:25,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:15:25,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:15:25,496 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:15:25,496 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:15:25,496 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:15:25,496 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:15:25,497 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:15:25,497 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:15:25,497 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:15:25,497 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:15:25,497 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:15:25,498 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:15:25,498 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:15:25,498 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:15:25,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:15:25,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:15:25,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:15:25,504 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:15:25,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:15:25,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:15:25,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:15:25,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:15:25,505 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:15:25,505 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:15:25,506 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:15:25,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:15:25,507 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:15:25,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:15:25,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:15:25,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:15:25,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:15:25,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:25,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:15:25,510 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:15:25,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:15:25,510 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:15:25,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:15:25,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:15:25,511 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_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2022-11-22 00:15:25,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:15:25,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:15:25,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:15:25,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:15:25,802 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:15:25,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-22 00:15:28,886 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:15:29,228 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:15:29,229 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-22 00:15:29,252 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/data/e2cb60f62/8cd8188dc91f4256b05e288ac778c6e8/FLAGaabaa97e1 [2022-11-22 00:15:29,267 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/data/e2cb60f62/8cd8188dc91f4256b05e288ac778c6e8 [2022-11-22 00:15:29,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:15:29,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:15:29,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:29,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:15:29,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:15:29,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:29,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce846a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29, skipping insertion in model container [2022-11-22 00:15:29,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:29,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:15:29,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:15:29,808 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-22 00:15:29,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:29,836 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:15:29,901 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-22 00:15:29,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:29,945 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:15:29,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29 WrapperNode [2022-11-22 00:15:29,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:29,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:29,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:15:29,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:15:29,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:29,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,031 INFO L138 Inliner]: procedures = 184, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2022-11-22 00:15:30,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:30,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:15:30,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:15:30,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:15:30,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,080 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:15:30,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:15:30,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:15:30,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:15:30,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (1/1) ... [2022-11-22 00:15:30,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:30,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:30,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:15:30,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:15:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:15:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-22 00:15:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-22 00:15:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2022-11-22 00:15:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2022-11-22 00:15:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:15:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 00:15:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2022-11-22 00:15:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2022-11-22 00:15:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:15:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 00:15:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:15:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2022-11-22 00:15:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2022-11-22 00:15:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2022-11-22 00:15:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2022-11-22 00:15:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2022-11-22 00:15:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2022-11-22 00:15:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 00:15:30,208 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2022-11-22 00:15:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2022-11-22 00:15:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:15:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2022-11-22 00:15:30,210 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2022-11-22 00:15:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:15:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2022-11-22 00:15:30,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2022-11-22 00:15:30,211 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-22 00:15:30,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:15:30,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:15:30,497 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:15:30,499 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:15:31,708 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:15:31,808 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:15:31,808 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:15:31,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:31 BoogieIcfgContainer [2022-11-22 00:15:31,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:15:31,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:15:31,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:15:31,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:15:31,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:15:29" (1/3) ... [2022-11-22 00:15:31,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a178490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:31, skipping insertion in model container [2022-11-22 00:15:31,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:29" (2/3) ... [2022-11-22 00:15:31,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a178490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:31, skipping insertion in model container [2022-11-22 00:15:31,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:31" (3/3) ... [2022-11-22 00:15:31,826 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2022-11-22 00:15:31,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:15:31,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2022-11-22 00:15:31,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:15:31,909 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@74f4ceed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:15:31,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2022-11-22 00:15:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 155 states have (on average 2.2) internal successors, (341), 317 states have internal predecessors, (341), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-22 00:15:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 00:15:31,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:31,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 00:15:31,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 582754168, now seen corresponding path program 1 times [2022-11-22 00:15:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:31,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522314583] [2022-11-22 00:15:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:32,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:32,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522314583] [2022-11-22 00:15:32,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522314583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:32,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:32,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434861897] [2022-11-22 00:15:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:32,365 INFO L87 Difference]: Start difference. First operand has 356 states, 155 states have (on average 2.2) internal successors, (341), 317 states have internal predecessors, (341), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:32,880 INFO L93 Difference]: Finished difference Result 381 states and 442 transitions. [2022-11-22 00:15:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2022-11-22 00:15:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:32,895 INFO L225 Difference]: With dead ends: 381 [2022-11-22 00:15:32,896 INFO L226 Difference]: Without dead ends: 380 [2022-11-22 00:15:32,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:32,900 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 355 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:32,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 235 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:15:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-22 00:15:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 351. [2022-11-22 00:15:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 169 states have (on average 2.0059171597633134) internal successors, (339), 307 states have internal predecessors, (339), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-22 00:15:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 408 transitions. [2022-11-22 00:15:32,961 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 408 transitions. Word has length 5 [2022-11-22 00:15:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:32,961 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 408 transitions. [2022-11-22 00:15:32,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 408 transitions. [2022-11-22 00:15:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 00:15:32,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:32,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 00:15:32,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:15:32,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash 582754169, now seen corresponding path program 1 times [2022-11-22 00:15:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:32,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915154660] [2022-11-22 00:15:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:33,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915154660] [2022-11-22 00:15:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915154660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:33,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:33,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265003729] [2022-11-22 00:15:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:33,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:33,203 INFO L87 Difference]: Start difference. First operand 351 states and 408 transitions. Second operand has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:33,688 INFO L93 Difference]: Finished difference Result 431 states and 515 transitions. [2022-11-22 00:15:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2022-11-22 00:15:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:33,691 INFO L225 Difference]: With dead ends: 431 [2022-11-22 00:15:33,692 INFO L226 Difference]: Without dead ends: 431 [2022-11-22 00:15:33,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:33,693 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 125 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:33,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 547 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:15:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-22 00:15:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2022-11-22 00:15:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 218 states have (on average 1.8761467889908257) internal successors, (409), 352 states have internal predecessors, (409), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-22 00:15:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 505 transitions. [2022-11-22 00:15:33,735 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 505 transitions. Word has length 5 [2022-11-22 00:15:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:33,735 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 505 transitions. [2022-11-22 00:15:33,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 505 transitions. [2022-11-22 00:15:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:15:33,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:33,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:33,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:15:33,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 572059377, now seen corresponding path program 1 times [2022-11-22 00:15:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:33,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915588049] [2022-11-22 00:15:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:33,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:33,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915588049] [2022-11-22 00:15:33,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915588049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:33,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:33,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:33,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060013383] [2022-11-22 00:15:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:33,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:33,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:33,952 INFO L87 Difference]: Start difference. First operand 411 states and 505 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:34,438 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2022-11-22 00:15:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:34,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-22 00:15:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:34,441 INFO L225 Difference]: With dead ends: 410 [2022-11-22 00:15:34,441 INFO L226 Difference]: Without dead ends: 410 [2022-11-22 00:15:34,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:34,442 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 13 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:34,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 892 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:15:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-22 00:15:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-22 00:15:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 218 states have (on average 1.871559633027523) internal successors, (408), 351 states have internal predecessors, (408), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-22 00:15:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2022-11-22 00:15:34,477 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 8 [2022-11-22 00:15:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:34,478 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2022-11-22 00:15:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2022-11-22 00:15:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:15:34,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:34,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:15:34,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 572059378, now seen corresponding path program 1 times [2022-11-22 00:15:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:34,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188088292] [2022-11-22 00:15:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:34,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:34,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188088292] [2022-11-22 00:15:34,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188088292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:34,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:34,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427501963] [2022-11-22 00:15:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:34,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:34,785 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:35,339 INFO L93 Difference]: Finished difference Result 409 states and 503 transitions. [2022-11-22 00:15:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-22 00:15:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:35,344 INFO L225 Difference]: With dead ends: 409 [2022-11-22 00:15:35,344 INFO L226 Difference]: Without dead ends: 409 [2022-11-22 00:15:35,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:35,345 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:35,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 877 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:15:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-22 00:15:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-11-22 00:15:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 218 states have (on average 1.8669724770642202) internal successors, (407), 350 states have internal predecessors, (407), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-22 00:15:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 503 transitions. [2022-11-22 00:15:35,362 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 503 transitions. Word has length 8 [2022-11-22 00:15:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:35,363 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 503 transitions. [2022-11-22 00:15:35,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 503 transitions. [2022-11-22 00:15:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:15:35,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:35,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:35,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:15:35,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2077472333, now seen corresponding path program 1 times [2022-11-22 00:15:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:35,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472663821] [2022-11-22 00:15:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:35,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472663821] [2022-11-22 00:15:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472663821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:35,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:35,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489405965] [2022-11-22 00:15:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:35,435 INFO L87 Difference]: Start difference. First operand 409 states and 503 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:35,684 INFO L93 Difference]: Finished difference Result 408 states and 502 transitions. [2022-11-22 00:15:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 00:15:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:35,688 INFO L225 Difference]: With dead ends: 408 [2022-11-22 00:15:35,688 INFO L226 Difference]: Without dead ends: 408 [2022-11-22 00:15:35,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:35,689 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 2 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:35,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 518 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-22 00:15:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2022-11-22 00:15:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 218 states have (on average 1.8623853211009174) internal successors, (406), 349 states have internal predecessors, (406), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-22 00:15:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 502 transitions. [2022-11-22 00:15:35,709 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 502 transitions. Word has length 12 [2022-11-22 00:15:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:35,709 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 502 transitions. [2022-11-22 00:15:35,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 502 transitions. [2022-11-22 00:15:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:15:35,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:35,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:15:35,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2077472332, now seen corresponding path program 1 times [2022-11-22 00:15:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:35,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972602326] [2022-11-22 00:15:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:35,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:35,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972602326] [2022-11-22 00:15:35,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972602326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:35,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:35,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815513045] [2022-11-22 00:15:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:35,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:35,853 INFO L87 Difference]: Start difference. First operand 408 states and 502 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:36,121 INFO L93 Difference]: Finished difference Result 407 states and 501 transitions. [2022-11-22 00:15:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 00:15:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:36,124 INFO L225 Difference]: With dead ends: 407 [2022-11-22 00:15:36,124 INFO L226 Difference]: Without dead ends: 407 [2022-11-22 00:15:36,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:36,125 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:36,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-22 00:15:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-11-22 00:15:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 218 states have (on average 1.8577981651376148) internal successors, (405), 348 states have internal predecessors, (405), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-22 00:15:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 501 transitions. [2022-11-22 00:15:36,141 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 501 transitions. Word has length 12 [2022-11-22 00:15:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:36,141 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 501 transitions. [2022-11-22 00:15:36,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 501 transitions. [2022-11-22 00:15:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:36,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:36,142 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-22 00:15:36,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:15:36,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash 578118043, now seen corresponding path program 1 times [2022-11-22 00:15:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:36,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241442421] [2022-11-22 00:15:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:36,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:36,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241442421] [2022-11-22 00:15:36,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241442421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:36,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:36,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653112208] [2022-11-22 00:15:36,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:36,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:36,388 INFO L87 Difference]: Start difference. First operand 407 states and 501 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:37,059 INFO L93 Difference]: Finished difference Result 437 states and 546 transitions. [2022-11-22 00:15:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 00:15:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:37,063 INFO L225 Difference]: With dead ends: 437 [2022-11-22 00:15:37,063 INFO L226 Difference]: Without dead ends: 437 [2022-11-22 00:15:37,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:37,064 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 44 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:37,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1269 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:15:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-22 00:15:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 426. [2022-11-22 00:15:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 233 states have (on average 1.832618025751073) internal successors, (427), 364 states have internal predecessors, (427), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-22 00:15:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2022-11-22 00:15:37,084 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 20 [2022-11-22 00:15:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:37,084 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2022-11-22 00:15:37,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2022-11-22 00:15:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:37,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:37,086 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-22 00:15:37,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:15:37,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 578118044, now seen corresponding path program 1 times [2022-11-22 00:15:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:37,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141394990] [2022-11-22 00:15:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:37,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141394990] [2022-11-22 00:15:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141394990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:37,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866769107] [2022-11-22 00:15:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:37,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:37,401 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:38,173 INFO L93 Difference]: Finished difference Result 436 states and 545 transitions. [2022-11-22 00:15:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:15:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 00:15:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:38,177 INFO L225 Difference]: With dead ends: 436 [2022-11-22 00:15:38,177 INFO L226 Difference]: Without dead ends: 436 [2022-11-22 00:15:38,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:38,179 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 38 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:38,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1217 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:15:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-11-22 00:15:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 426. [2022-11-22 00:15:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 233 states have (on average 1.8283261802575108) internal successors, (426), 364 states have internal predecessors, (426), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-22 00:15:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 527 transitions. [2022-11-22 00:15:38,207 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 527 transitions. Word has length 20 [2022-11-22 00:15:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:38,207 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 527 transitions. [2022-11-22 00:15:38,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 527 transitions. [2022-11-22 00:15:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:38,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:38,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:38,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:15:38,209 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 730721990, now seen corresponding path program 1 times [2022-11-22 00:15:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:38,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058329203] [2022-11-22 00:15:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:38,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:38,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058329203] [2022-11-22 00:15:38,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058329203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:38,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:38,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110117148] [2022-11-22 00:15:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:38,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:38,407 INFO L87 Difference]: Start difference. First operand 426 states and 527 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:39,131 INFO L93 Difference]: Finished difference Result 522 states and 663 transitions. [2022-11-22 00:15:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-22 00:15:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:39,134 INFO L225 Difference]: With dead ends: 522 [2022-11-22 00:15:39,135 INFO L226 Difference]: Without dead ends: 522 [2022-11-22 00:15:39,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:39,137 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 160 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:39,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1227 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:15:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-22 00:15:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 458. [2022-11-22 00:15:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 256 states have (on average 1.80859375) internal successors, (463), 390 states have internal predecessors, (463), 49 states have call successors, (49), 24 states have call predecessors, (49), 24 states have return successors, (70), 43 states have call predecessors, (70), 49 states have call successors, (70) [2022-11-22 00:15:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 582 transitions. [2022-11-22 00:15:39,158 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 582 transitions. Word has length 21 [2022-11-22 00:15:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:39,159 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 582 transitions. [2022-11-22 00:15:39,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 582 transitions. [2022-11-22 00:15:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:39,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:39,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:15:39,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash 730721991, now seen corresponding path program 1 times [2022-11-22 00:15:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:39,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210962805] [2022-11-22 00:15:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:39,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:39,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210962805] [2022-11-22 00:15:39,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210962805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:39,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:39,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965841008] [2022-11-22 00:15:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:39,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:39,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:39,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:39,468 INFO L87 Difference]: Start difference. First operand 458 states and 582 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:40,204 INFO L93 Difference]: Finished difference Result 467 states and 594 transitions. [2022-11-22 00:15:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:15:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-22 00:15:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:40,207 INFO L225 Difference]: With dead ends: 467 [2022-11-22 00:15:40,208 INFO L226 Difference]: Without dead ends: 467 [2022-11-22 00:15:40,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:40,209 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 35 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:40,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1217 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:15:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-11-22 00:15:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 458. [2022-11-22 00:15:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 256 states have (on average 1.8046875) internal successors, (462), 390 states have internal predecessors, (462), 49 states have call successors, (49), 24 states have call predecessors, (49), 24 states have return successors, (70), 43 states have call predecessors, (70), 49 states have call successors, (70) [2022-11-22 00:15:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 581 transitions. [2022-11-22 00:15:40,232 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 581 transitions. Word has length 21 [2022-11-22 00:15:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:40,233 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 581 transitions. [2022-11-22 00:15:40,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 581 transitions. [2022-11-22 00:15:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:40,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:40,240 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-22 00:15:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:15:40,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 629327487, now seen corresponding path program 1 times [2022-11-22 00:15:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307678143] [2022-11-22 00:15:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:40,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:40,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307678143] [2022-11-22 00:15:40,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307678143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:40,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:40,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:15:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187055512] [2022-11-22 00:15:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:40,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:15:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:40,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:15:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:15:40,628 INFO L87 Difference]: Start difference. First operand 458 states and 581 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:42,079 INFO L93 Difference]: Finished difference Result 672 states and 915 transitions. [2022-11-22 00:15:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 00:15:42,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-11-22 00:15:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:42,084 INFO L225 Difference]: With dead ends: 672 [2022-11-22 00:15:42,084 INFO L226 Difference]: Without dead ends: 672 [2022-11-22 00:15:42,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-22 00:15:42,085 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 705 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:42,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 810 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 00:15:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-11-22 00:15:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 563. [2022-11-22 00:15:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 332 states have (on average 1.7018072289156627) internal successors, (565), 467 states have internal predecessors, (565), 63 states have call successors, (63), 30 states have call predecessors, (63), 39 states have return successors, (138), 65 states have call predecessors, (138), 63 states have call successors, (138) [2022-11-22 00:15:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 766 transitions. [2022-11-22 00:15:42,112 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 766 transitions. Word has length 20 [2022-11-22 00:15:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:42,112 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 766 transitions. [2022-11-22 00:15:42,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 766 transitions. [2022-11-22 00:15:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:15:42,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:42,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:15:42,119 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1166987801, now seen corresponding path program 1 times [2022-11-22 00:15:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:42,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484958051] [2022-11-22 00:15:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:42,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:42,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484958051] [2022-11-22 00:15:42,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484958051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:42,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:42,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992349687] [2022-11-22 00:15:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:42,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:42,417 INFO L87 Difference]: Start difference. First operand 563 states and 766 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:43,180 INFO L93 Difference]: Finished difference Result 637 states and 892 transitions. [2022-11-22 00:15:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 00:15:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:43,184 INFO L225 Difference]: With dead ends: 637 [2022-11-22 00:15:43,185 INFO L226 Difference]: Without dead ends: 637 [2022-11-22 00:15:43,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:43,185 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 48 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:43,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1213 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:15:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-22 00:15:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2022-11-22 00:15:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 377 states have (on average 1.663129973474801) internal successors, (627), 516 states have internal predecessors, (627), 70 states have call successors, (70), 34 states have call predecessors, (70), 48 states have return successors, (170), 73 states have call predecessors, (170), 70 states have call successors, (170) [2022-11-22 00:15:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 867 transitions. [2022-11-22 00:15:43,213 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 867 transitions. Word has length 22 [2022-11-22 00:15:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:43,213 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 867 transitions. [2022-11-22 00:15:43,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 867 transitions. [2022-11-22 00:15:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:15:43,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:43,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:43,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:15:43,215 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1166987800, now seen corresponding path program 1 times [2022-11-22 00:15:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:43,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452275753] [2022-11-22 00:15:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:43,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452275753] [2022-11-22 00:15:43,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452275753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:43,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:43,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:43,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394150473] [2022-11-22 00:15:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:43,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:43,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:43,428 INFO L87 Difference]: Start difference. First operand 624 states and 867 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:44,102 INFO L93 Difference]: Finished difference Result 753 states and 1089 transitions. [2022-11-22 00:15:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 00:15:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:44,107 INFO L225 Difference]: With dead ends: 753 [2022-11-22 00:15:44,107 INFO L226 Difference]: Without dead ends: 753 [2022-11-22 00:15:44,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:44,108 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 105 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:44,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1244 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:15:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-11-22 00:15:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 702. [2022-11-22 00:15:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 439 states have (on average 1.6264236902050113) internal successors, (714), 581 states have internal predecessors, (714), 73 states have call successors, (73), 40 states have call predecessors, (73), 61 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2022-11-22 00:15:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 988 transitions. [2022-11-22 00:15:44,137 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 988 transitions. Word has length 22 [2022-11-22 00:15:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:44,137 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 988 transitions. [2022-11-22 00:15:44,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 988 transitions. [2022-11-22 00:15:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:15:44,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:44,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:44,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 00:15:44,139 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1806107075, now seen corresponding path program 1 times [2022-11-22 00:15:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:44,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142216089] [2022-11-22 00:15:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:44,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:44,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142216089] [2022-11-22 00:15:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142216089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:44,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:44,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671434652] [2022-11-22 00:15:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:44,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:44,307 INFO L87 Difference]: Start difference. First operand 702 states and 988 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:44,955 INFO L93 Difference]: Finished difference Result 831 states and 1229 transitions. [2022-11-22 00:15:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:44,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-22 00:15:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:44,960 INFO L225 Difference]: With dead ends: 831 [2022-11-22 00:15:44,961 INFO L226 Difference]: Without dead ends: 831 [2022-11-22 00:15:44,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:44,962 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 80 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:44,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1249 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:15:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-22 00:15:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 782. [2022-11-22 00:15:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 503 states have (on average 1.6043737574552683) internal successors, (807), 651 states have internal predecessors, (807), 76 states have call successors, (76), 44 states have call predecessors, (76), 74 states have return successors, (232), 86 states have call predecessors, (232), 76 states have call successors, (232) [2022-11-22 00:15:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1115 transitions. [2022-11-22 00:15:44,997 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1115 transitions. Word has length 23 [2022-11-22 00:15:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:44,999 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1115 transitions. [2022-11-22 00:15:44,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1115 transitions. [2022-11-22 00:15:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:15:45,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:45,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:45,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 00:15:45,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1806107076, now seen corresponding path program 1 times [2022-11-22 00:15:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393295892] [2022-11-22 00:15:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:45,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393295892] [2022-11-22 00:15:45,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393295892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:45,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:45,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990255982] [2022-11-22 00:15:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:45,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:45,271 INFO L87 Difference]: Start difference. First operand 782 states and 1115 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:46,016 INFO L93 Difference]: Finished difference Result 876 states and 1283 transitions. [2022-11-22 00:15:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-22 00:15:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:46,022 INFO L225 Difference]: With dead ends: 876 [2022-11-22 00:15:46,022 INFO L226 Difference]: Without dead ends: 876 [2022-11-22 00:15:46,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:46,023 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 61 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:46,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1213 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:15:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-11-22 00:15:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 856. [2022-11-22 00:15:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 560 states have (on average 1.582142857142857) internal successors, (886), 712 states have internal predecessors, (886), 83 states have call successors, (83), 48 states have call predecessors, (83), 84 states have return successors, (267), 95 states have call predecessors, (267), 83 states have call successors, (267) [2022-11-22 00:15:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1236 transitions. [2022-11-22 00:15:46,058 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1236 transitions. Word has length 23 [2022-11-22 00:15:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:46,058 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 1236 transitions. [2022-11-22 00:15:46,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1236 transitions. [2022-11-22 00:15:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 00:15:46,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:46,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:46,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 00:15:46,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2020875180, now seen corresponding path program 1 times [2022-11-22 00:15:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:46,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016616955] [2022-11-22 00:15:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:46,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:46,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016616955] [2022-11-22 00:15:46,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016616955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:46,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:46,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:15:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579418567] [2022-11-22 00:15:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:46,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:15:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:15:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:46,394 INFO L87 Difference]: Start difference. First operand 856 states and 1236 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:46,929 INFO L93 Difference]: Finished difference Result 812 states and 1161 transitions. [2022-11-22 00:15:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:15:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-22 00:15:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:46,937 INFO L225 Difference]: With dead ends: 812 [2022-11-22 00:15:46,937 INFO L226 Difference]: Without dead ends: 812 [2022-11-22 00:15:46,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:15:46,938 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 38 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:46,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2260 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:15:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-22 00:15:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 789. [2022-11-22 00:15:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 512 states have (on average 1.607421875) internal successors, (823), 658 states have internal predecessors, (823), 77 states have call successors, (77), 45 states have call predecessors, (77), 71 states have return successors, (225), 85 states have call predecessors, (225), 77 states have call successors, (225) [2022-11-22 00:15:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1125 transitions. [2022-11-22 00:15:46,977 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1125 transitions. Word has length 25 [2022-11-22 00:15:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:46,978 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1125 transitions. [2022-11-22 00:15:46,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:15:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1125 transitions. [2022-11-22 00:15:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 00:15:46,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:46,979 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:46,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 00:15:46,979 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -315897385, now seen corresponding path program 1 times [2022-11-22 00:15:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556560772] [2022-11-22 00:15:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:15:47,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:47,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556560772] [2022-11-22 00:15:47,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556560772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:47,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:47,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265264767] [2022-11-22 00:15:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:47,069 INFO L87 Difference]: Start difference. First operand 789 states and 1125 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:47,380 INFO L93 Difference]: Finished difference Result 787 states and 1123 transitions. [2022-11-22 00:15:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:47,381 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-22 00:15:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:47,385 INFO L225 Difference]: With dead ends: 787 [2022-11-22 00:15:47,385 INFO L226 Difference]: Without dead ends: 787 [2022-11-22 00:15:47,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:47,386 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 33 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:47,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 689 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:15:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-11-22 00:15:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2022-11-22 00:15:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 512 states have (on average 1.603515625) internal successors, (821), 656 states have internal predecessors, (821), 77 states have call successors, (77), 45 states have call predecessors, (77), 71 states have return successors, (225), 85 states have call predecessors, (225), 77 states have call successors, (225) [2022-11-22 00:15:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1123 transitions. [2022-11-22 00:15:47,415 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1123 transitions. Word has length 27 [2022-11-22 00:15:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:47,416 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1123 transitions. [2022-11-22 00:15:47,416 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1123 transitions. [2022-11-22 00:15:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 00:15:47,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:47,417 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:47,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 00:15:47,417 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -315897384, now seen corresponding path program 1 times [2022-11-22 00:15:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:47,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774783264] [2022-11-22 00:15:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:15:47,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774783264] [2022-11-22 00:15:47,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774783264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:47,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:47,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:15:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800170564] [2022-11-22 00:15:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:47,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:15:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:15:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:15:47,800 INFO L87 Difference]: Start difference. First operand 787 states and 1123 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:48,265 INFO L93 Difference]: Finished difference Result 796 states and 1139 transitions. [2022-11-22 00:15:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:15:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-22 00:15:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:48,270 INFO L225 Difference]: With dead ends: 796 [2022-11-22 00:15:48,270 INFO L226 Difference]: Without dead ends: 796 [2022-11-22 00:15:48,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:15:48,273 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 35 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:48,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1941 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:15:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-11-22 00:15:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 787. [2022-11-22 00:15:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 512 states have (on average 1.6015625) internal successors, (820), 656 states have internal predecessors, (820), 77 states have call successors, (77), 45 states have call predecessors, (77), 71 states have return successors, (225), 85 states have call predecessors, (225), 77 states have call successors, (225) [2022-11-22 00:15:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1122 transitions. [2022-11-22 00:15:48,301 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1122 transitions. Word has length 27 [2022-11-22 00:15:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:48,302 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1122 transitions. [2022-11-22 00:15:48,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1122 transitions. [2022-11-22 00:15:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 00:15:48,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:48,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:48,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 00:15:48,303 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:48,304 INFO L85 PathProgramCache]: Analyzing trace with hash -188634323, now seen corresponding path program 1 times [2022-11-22 00:15:48,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:48,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963969456] [2022-11-22 00:15:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:48,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:48,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963969456] [2022-11-22 00:15:48,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963969456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:48,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:48,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:15:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987498462] [2022-11-22 00:15:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:48,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:15:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:15:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:48,634 INFO L87 Difference]: Start difference. First operand 787 states and 1122 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:50,093 INFO L93 Difference]: Finished difference Result 589 states and 784 transitions. [2022-11-22 00:15:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 00:15:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-22 00:15:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:50,099 INFO L225 Difference]: With dead ends: 589 [2022-11-22 00:15:50,099 INFO L226 Difference]: Without dead ends: 589 [2022-11-22 00:15:50,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-11-22 00:15:50,101 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 775 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:50,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 840 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 00:15:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-22 00:15:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 485. [2022-11-22 00:15:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 280 states have (on average 1.7714285714285714) internal successors, (496), 412 states have internal predecessors, (496), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (103), 45 states have call predecessors, (103), 49 states have call successors, (103) [2022-11-22 00:15:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 648 transitions. [2022-11-22 00:15:50,124 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 648 transitions. Word has length 25 [2022-11-22 00:15:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:50,126 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 648 transitions. [2022-11-22 00:15:50,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 648 transitions. [2022-11-22 00:15:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 00:15:50,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:50,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 00:15:50,128 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1707754842, now seen corresponding path program 1 times [2022-11-22 00:15:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:50,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507774976] [2022-11-22 00:15:50,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:50,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:50,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507774976] [2022-11-22 00:15:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507774976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:50,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:50,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471664347] [2022-11-22 00:15:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:50,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:50,294 INFO L87 Difference]: Start difference. First operand 485 states and 648 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:50,447 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2022-11-22 00:15:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-22 00:15:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:50,449 INFO L225 Difference]: With dead ends: 483 [2022-11-22 00:15:50,450 INFO L226 Difference]: Without dead ends: 475 [2022-11-22 00:15:50,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:50,451 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 11 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:50,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 897 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-22 00:15:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-22 00:15:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 273 states have (on average 1.7545787545787546) internal successors, (479), 405 states have internal predecessors, (479), 47 states have call successors, (47), 26 states have call predecessors, (47), 28 states have return successors, (93), 43 states have call predecessors, (93), 47 states have call successors, (93) [2022-11-22 00:15:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 619 transitions. [2022-11-22 00:15:50,469 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 619 transitions. Word has length 30 [2022-11-22 00:15:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:50,469 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 619 transitions. [2022-11-22 00:15:50,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 619 transitions. [2022-11-22 00:15:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 00:15:50,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:50,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:50,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 00:15:50,471 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:50,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1393656363, now seen corresponding path program 1 times [2022-11-22 00:15:50,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:50,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978683034] [2022-11-22 00:15:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:50,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:50,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978683034] [2022-11-22 00:15:50,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978683034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:50,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:50,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:15:50,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688648750] [2022-11-22 00:15:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:50,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:15:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:15:50,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:50,715 INFO L87 Difference]: Start difference. First operand 475 states and 619 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:15:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:51,447 INFO L93 Difference]: Finished difference Result 514 states and 682 transitions. [2022-11-22 00:15:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:15:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-11-22 00:15:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:51,450 INFO L225 Difference]: With dead ends: 514 [2022-11-22 00:15:51,450 INFO L226 Difference]: Without dead ends: 508 [2022-11-22 00:15:51,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:15:51,451 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 143 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:51,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1737 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:15:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-11-22 00:15:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 475. [2022-11-22 00:15:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 273 states have (on average 1.750915750915751) internal successors, (478), 405 states have internal predecessors, (478), 47 states have call successors, (47), 26 states have call predecessors, (47), 28 states have return successors, (94), 43 states have call predecessors, (94), 47 states have call successors, (94) [2022-11-22 00:15:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 619 transitions. [2022-11-22 00:15:51,466 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 619 transitions. Word has length 29 [2022-11-22 00:15:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:51,466 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 619 transitions. [2022-11-22 00:15:51,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:15:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 619 transitions. [2022-11-22 00:15:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 00:15:51,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:51,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:51,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 00:15:51,468 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -883195324, now seen corresponding path program 1 times [2022-11-22 00:15:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:51,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206546845] [2022-11-22 00:15:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:51,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:51,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206546845] [2022-11-22 00:15:51,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206546845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:51,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:51,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 00:15:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254950019] [2022-11-22 00:15:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:51,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:15:51,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:15:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:51,820 INFO L87 Difference]: Start difference. First operand 475 states and 619 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:52,936 INFO L93 Difference]: Finished difference Result 646 states and 910 transitions. [2022-11-22 00:15:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 00:15:52,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-22 00:15:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:52,942 INFO L225 Difference]: With dead ends: 646 [2022-11-22 00:15:52,942 INFO L226 Difference]: Without dead ends: 640 [2022-11-22 00:15:52,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-11-22 00:15:52,944 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 313 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:52,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1421 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 00:15:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-22 00:15:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2022-11-22 00:15:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 358 states have (on average 1.6592178770949721) internal successors, (594), 486 states have internal predecessors, (594), 57 states have call successors, (57), 33 states have call predecessors, (57), 45 states have return successors, (190), 67 states have call predecessors, (190), 57 states have call successors, (190) [2022-11-22 00:15:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 841 transitions. [2022-11-22 00:15:52,993 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 841 transitions. Word has length 32 [2022-11-22 00:15:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:52,993 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 841 transitions. [2022-11-22 00:15:52,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 841 transitions. [2022-11-22 00:15:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 00:15:52,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:52,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:52,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 00:15:52,994 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1758852491, now seen corresponding path program 1 times [2022-11-22 00:15:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854800798] [2022-11-22 00:15:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:53,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:53,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854800798] [2022-11-22 00:15:53,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854800798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:53,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:53,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 00:15:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418544586] [2022-11-22 00:15:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:53,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:15:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:15:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:15:53,319 INFO L87 Difference]: Start difference. First operand 587 states and 841 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:53,965 INFO L93 Difference]: Finished difference Result 608 states and 894 transitions. [2022-11-22 00:15:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-11-22 00:15:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:53,969 INFO L225 Difference]: With dead ends: 608 [2022-11-22 00:15:53,970 INFO L226 Difference]: Without dead ends: 608 [2022-11-22 00:15:53,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:53,970 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 702 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:53,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 256 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:15:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-22 00:15:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-11-22 00:15:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 467 states have internal predecessors, (561), 57 states have call successors, (57), 33 states have call predecessors, (57), 45 states have return successors, (190), 67 states have call predecessors, (190), 57 states have call successors, (190) [2022-11-22 00:15:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 808 transitions. [2022-11-22 00:15:53,993 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 808 transitions. Word has length 33 [2022-11-22 00:15:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:53,993 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 808 transitions. [2022-11-22 00:15:53,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 808 transitions. [2022-11-22 00:15:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 00:15:53,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:53,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:53,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 00:15:53,994 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1310147535, now seen corresponding path program 1 times [2022-11-22 00:15:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:53,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124771707] [2022-11-22 00:15:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:54,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:54,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124771707] [2022-11-22 00:15:54,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124771707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:54,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:54,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 00:15:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183135119] [2022-11-22 00:15:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:15:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:15:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:15:54,808 INFO L87 Difference]: Start difference. First operand 568 states and 808 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:56,044 INFO L93 Difference]: Finished difference Result 625 states and 934 transitions. [2022-11-22 00:15:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 00:15:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-22 00:15:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:56,048 INFO L225 Difference]: With dead ends: 625 [2022-11-22 00:15:56,048 INFO L226 Difference]: Without dead ends: 625 [2022-11-22 00:15:56,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-11-22 00:15:56,049 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 202 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:56,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1399 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 00:15:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-22 00:15:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 573. [2022-11-22 00:15:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 362 states have (on average 1.5635359116022098) internal successors, (566), 470 states have internal predecessors, (566), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-22 00:15:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 816 transitions. [2022-11-22 00:15:56,074 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 816 transitions. Word has length 34 [2022-11-22 00:15:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:56,074 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 816 transitions. [2022-11-22 00:15:56,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 816 transitions. [2022-11-22 00:15:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 00:15:56,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:56,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 00:15:56,075 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1310147534, now seen corresponding path program 1 times [2022-11-22 00:15:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307362243] [2022-11-22 00:15:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:57,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307362243] [2022-11-22 00:15:57,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307362243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:57,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:57,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 00:15:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124549754] [2022-11-22 00:15:57,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:57,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 00:15:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:57,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 00:15:57,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:15:57,335 INFO L87 Difference]: Start difference. First operand 573 states and 816 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:59,143 INFO L93 Difference]: Finished difference Result 624 states and 933 transitions. [2022-11-22 00:15:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:15:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-22 00:15:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:59,147 INFO L225 Difference]: With dead ends: 624 [2022-11-22 00:15:59,147 INFO L226 Difference]: Without dead ends: 624 [2022-11-22 00:15:59,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2022-11-22 00:15:59,148 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 477 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:59,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1252 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-22 00:15:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-22 00:15:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 573. [2022-11-22 00:15:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 470 states have internal predecessors, (565), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-22 00:15:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 815 transitions. [2022-11-22 00:15:59,185 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 815 transitions. Word has length 34 [2022-11-22 00:15:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:59,185 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 815 transitions. [2022-11-22 00:15:59,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:15:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 815 transitions. [2022-11-22 00:15:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 00:15:59,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:59,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:59,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 00:15:59,187 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -626359150, now seen corresponding path program 1 times [2022-11-22 00:15:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410476304] [2022-11-22 00:15:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:59,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:59,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410476304] [2022-11-22 00:15:59,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410476304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:59,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:59,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624870285] [2022-11-22 00:15:59,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:59,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:59,267 INFO L87 Difference]: Start difference. First operand 573 states and 815 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:59,487 INFO L93 Difference]: Finished difference Result 571 states and 811 transitions. [2022-11-22 00:15:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-22 00:15:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:59,491 INFO L225 Difference]: With dead ends: 571 [2022-11-22 00:15:59,491 INFO L226 Difference]: Without dead ends: 571 [2022-11-22 00:15:59,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:59,492 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:59,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 463 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-22 00:15:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2022-11-22 00:15:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 362 states have (on average 1.5497237569060773) internal successors, (561), 468 states have internal predecessors, (561), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-22 00:15:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 811 transitions. [2022-11-22 00:15:59,519 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 811 transitions. Word has length 36 [2022-11-22 00:15:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:59,519 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 811 transitions. [2022-11-22 00:15:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 811 transitions. [2022-11-22 00:15:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 00:15:59,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:59,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:59,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 00:15:59,521 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash -626359149, now seen corresponding path program 1 times [2022-11-22 00:15:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:59,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28028485] [2022-11-22 00:15:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:59,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:59,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28028485] [2022-11-22 00:15:59,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28028485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:59,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:59,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588949891] [2022-11-22 00:15:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:59,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:59,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:59,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:59,627 INFO L87 Difference]: Start difference. First operand 571 states and 811 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:59,854 INFO L93 Difference]: Finished difference Result 569 states and 807 transitions. [2022-11-22 00:15:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:59,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-22 00:15:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:59,862 INFO L225 Difference]: With dead ends: 569 [2022-11-22 00:15:59,862 INFO L226 Difference]: Without dead ends: 569 [2022-11-22 00:15:59,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:59,864 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:59,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 467 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-22 00:15:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2022-11-22 00:15:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 362 states have (on average 1.5386740331491713) internal successors, (557), 466 states have internal predecessors, (557), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-22 00:15:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 807 transitions. [2022-11-22 00:15:59,902 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 807 transitions. Word has length 36 [2022-11-22 00:15:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:59,903 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 807 transitions. [2022-11-22 00:15:59,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:15:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 807 transitions. [2022-11-22 00:15:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 00:15:59,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:59,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:59,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-22 00:15:59,904 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:15:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -946818662, now seen corresponding path program 1 times [2022-11-22 00:15:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036211166] [2022-11-22 00:15:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:00,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036211166] [2022-11-22 00:16:00,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036211166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:00,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:00,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631927671] [2022-11-22 00:16:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:00,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:00,083 INFO L87 Difference]: Start difference. First operand 569 states and 807 transitions. Second operand has 7 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:00,679 INFO L93 Difference]: Finished difference Result 598 states and 856 transitions. [2022-11-22 00:16:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:16:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-22 00:16:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:00,683 INFO L225 Difference]: With dead ends: 598 [2022-11-22 00:16:00,684 INFO L226 Difference]: Without dead ends: 598 [2022-11-22 00:16:00,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:00,685 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 48 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:00,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1164 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-22 00:16:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 589. [2022-11-22 00:16:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 378 states have (on average 1.5343915343915344) internal successors, (580), 483 states have internal predecessors, (580), 59 states have call successors, (59), 36 states have call predecessors, (59), 48 states have return successors, (197), 69 states have call predecessors, (197), 59 states have call successors, (197) [2022-11-22 00:16:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2022-11-22 00:16:00,706 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 44 [2022-11-22 00:16:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:00,706 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2022-11-22 00:16:00,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2022-11-22 00:16:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 00:16:00,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:00,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:00,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-22 00:16:00,708 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -946818661, now seen corresponding path program 1 times [2022-11-22 00:16:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:00,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226789798] [2022-11-22 00:16:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:01,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:01,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226789798] [2022-11-22 00:16:01,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226789798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:01,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:01,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524994838] [2022-11-22 00:16:01,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:01,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:01,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:01,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:01,026 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:01,684 INFO L93 Difference]: Finished difference Result 597 states and 855 transitions. [2022-11-22 00:16:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:16:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-22 00:16:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:01,688 INFO L225 Difference]: With dead ends: 597 [2022-11-22 00:16:01,688 INFO L226 Difference]: Without dead ends: 597 [2022-11-22 00:16:01,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:01,689 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 42 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:01,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1205 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-22 00:16:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2022-11-22 00:16:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 378 states have (on average 1.5317460317460319) internal successors, (579), 483 states have internal predecessors, (579), 59 states have call successors, (59), 36 states have call predecessors, (59), 48 states have return successors, (197), 69 states have call predecessors, (197), 59 states have call successors, (197) [2022-11-22 00:16:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 835 transitions. [2022-11-22 00:16:01,710 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 835 transitions. Word has length 44 [2022-11-22 00:16:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:01,710 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 835 transitions. [2022-11-22 00:16:01,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 835 transitions. [2022-11-22 00:16:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 00:16:01,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:01,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:01,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-22 00:16:01,711 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash 702324391, now seen corresponding path program 1 times [2022-11-22 00:16:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:01,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730479296] [2022-11-22 00:16:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:01,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730479296] [2022-11-22 00:16:01,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730479296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:01,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:01,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787118537] [2022-11-22 00:16:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:01,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:01,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:01,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:01,868 INFO L87 Difference]: Start difference. First operand 589 states and 835 transitions. Second operand has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:02,520 INFO L93 Difference]: Finished difference Result 653 states and 925 transitions. [2022-11-22 00:16:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:16:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-22 00:16:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:02,526 INFO L225 Difference]: With dead ends: 653 [2022-11-22 00:16:02,526 INFO L226 Difference]: Without dead ends: 653 [2022-11-22 00:16:02,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:02,527 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 157 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:02,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1100 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-11-22 00:16:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2022-11-22 00:16:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 384 states have (on average 1.53125) internal successors, (588), 489 states have internal predecessors, (588), 60 states have call successors, (60), 37 states have call predecessors, (60), 49 states have return successors, (200), 70 states have call predecessors, (200), 60 states have call successors, (200) [2022-11-22 00:16:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2022-11-22 00:16:02,567 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 45 [2022-11-22 00:16:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:02,568 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2022-11-22 00:16:02,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2022-11-22 00:16:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 00:16:02,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:02,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:02,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-22 00:16:02,570 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash 702324392, now seen corresponding path program 1 times [2022-11-22 00:16:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:02,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763608276] [2022-11-22 00:16:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:02,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:02,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763608276] [2022-11-22 00:16:02,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763608276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:02,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:02,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750038214] [2022-11-22 00:16:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:02,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:02,928 INFO L87 Difference]: Start difference. First operand 597 states and 848 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:03,584 INFO L93 Difference]: Finished difference Result 604 states and 861 transitions. [2022-11-22 00:16:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:16:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-22 00:16:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:03,588 INFO L225 Difference]: With dead ends: 604 [2022-11-22 00:16:03,588 INFO L226 Difference]: Without dead ends: 604 [2022-11-22 00:16:03,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:03,589 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 39 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:03,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1182 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-22 00:16:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 597. [2022-11-22 00:16:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 384 states have (on average 1.5286458333333333) internal successors, (587), 489 states have internal predecessors, (587), 60 states have call successors, (60), 37 states have call predecessors, (60), 49 states have return successors, (200), 70 states have call predecessors, (200), 60 states have call successors, (200) [2022-11-22 00:16:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 847 transitions. [2022-11-22 00:16:03,610 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 847 transitions. Word has length 45 [2022-11-22 00:16:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:03,611 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 847 transitions. [2022-11-22 00:16:03,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 847 transitions. [2022-11-22 00:16:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 00:16:03,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:03,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:03,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-22 00:16:03,612 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 286662232, now seen corresponding path program 1 times [2022-11-22 00:16:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:03,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475790344] [2022-11-22 00:16:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:03,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:03,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475790344] [2022-11-22 00:16:03,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475790344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:03,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:03,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17844240] [2022-11-22 00:16:03,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:03,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:03,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:03,918 INFO L87 Difference]: Start difference. First operand 597 states and 847 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:04,624 INFO L93 Difference]: Finished difference Result 658 states and 956 transitions. [2022-11-22 00:16:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:16:04,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-22 00:16:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:04,629 INFO L225 Difference]: With dead ends: 658 [2022-11-22 00:16:04,629 INFO L226 Difference]: Without dead ends: 658 [2022-11-22 00:16:04,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:04,630 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 52 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:04,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1174 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 00:16:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-22 00:16:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 643. [2022-11-22 00:16:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 419 states have (on average 1.5178997613365155) internal successors, (636), 525 states have internal predecessors, (636), 65 states have call successors, (65), 41 states have call predecessors, (65), 55 states have return successors, (228), 76 states have call predecessors, (228), 65 states have call successors, (228) [2022-11-22 00:16:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 929 transitions. [2022-11-22 00:16:04,656 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 929 transitions. Word has length 46 [2022-11-22 00:16:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:04,656 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 929 transitions. [2022-11-22 00:16:04,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 929 transitions. [2022-11-22 00:16:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 00:16:04,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:04,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:04,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-22 00:16:04,658 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 286662231, now seen corresponding path program 1 times [2022-11-22 00:16:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:04,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215142683] [2022-11-22 00:16:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:04,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215142683] [2022-11-22 00:16:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215142683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:04,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:04,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485186238] [2022-11-22 00:16:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:04,822 INFO L87 Difference]: Start difference. First operand 643 states and 929 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:05,435 INFO L93 Difference]: Finished difference Result 692 states and 1013 transitions. [2022-11-22 00:16:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:16:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-22 00:16:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:05,440 INFO L225 Difference]: With dead ends: 692 [2022-11-22 00:16:05,440 INFO L226 Difference]: Without dead ends: 692 [2022-11-22 00:16:05,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:05,441 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 110 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:05,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1111 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-22 00:16:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 654. [2022-11-22 00:16:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 426 states have (on average 1.5070422535211268) internal successors, (642), 534 states have internal predecessors, (642), 65 states have call successors, (65), 41 states have call predecessors, (65), 59 states have return successors, (236), 78 states have call predecessors, (236), 65 states have call successors, (236) [2022-11-22 00:16:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 943 transitions. [2022-11-22 00:16:05,464 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 943 transitions. Word has length 46 [2022-11-22 00:16:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:05,465 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 943 transitions. [2022-11-22 00:16:05,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 943 transitions. [2022-11-22 00:16:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 00:16:05,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:05,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:05,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-22 00:16:05,466 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 285818212, now seen corresponding path program 1 times [2022-11-22 00:16:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:05,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651943455] [2022-11-22 00:16:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:05,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:05,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651943455] [2022-11-22 00:16:05,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651943455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:05,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:05,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908403208] [2022-11-22 00:16:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:05,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:05,647 INFO L87 Difference]: Start difference. First operand 654 states and 943 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:06,291 INFO L93 Difference]: Finished difference Result 711 states and 1055 transitions. [2022-11-22 00:16:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:16:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-22 00:16:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:06,297 INFO L225 Difference]: With dead ends: 711 [2022-11-22 00:16:06,297 INFO L226 Difference]: Without dead ends: 711 [2022-11-22 00:16:06,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:06,298 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 82 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:06,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1116 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-22 00:16:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 669. [2022-11-22 00:16:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 438 states have (on average 1.5091324200913243) internal successors, (661), 547 states have internal predecessors, (661), 66 states have call successors, (66), 42 states have call predecessors, (66), 61 states have return successors, (241), 79 states have call predecessors, (241), 66 states have call successors, (241) [2022-11-22 00:16:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 968 transitions. [2022-11-22 00:16:06,324 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 968 transitions. Word has length 47 [2022-11-22 00:16:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:06,325 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 968 transitions. [2022-11-22 00:16:06,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 968 transitions. [2022-11-22 00:16:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 00:16:06,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:06,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:06,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-22 00:16:06,326 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash 285818213, now seen corresponding path program 1 times [2022-11-22 00:16:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:06,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668307457] [2022-11-22 00:16:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:06,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:06,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668307457] [2022-11-22 00:16:06,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668307457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:06,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:06,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:16:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285217222] [2022-11-22 00:16:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:06,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:06,649 INFO L87 Difference]: Start difference. First operand 669 states and 968 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:07,350 INFO L93 Difference]: Finished difference Result 737 states and 1089 transitions. [2022-11-22 00:16:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:16:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-22 00:16:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:07,355 INFO L225 Difference]: With dead ends: 737 [2022-11-22 00:16:07,355 INFO L226 Difference]: Without dead ends: 737 [2022-11-22 00:16:07,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:07,356 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 65 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:07,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1174 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:16:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-11-22 00:16:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 718. [2022-11-22 00:16:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 476 states have (on average 1.495798319327731) internal successors, (712), 587 states have internal predecessors, (712), 70 states have call successors, (70), 45 states have call predecessors, (70), 68 states have return successors, (268), 85 states have call predecessors, (268), 70 states have call successors, (268) [2022-11-22 00:16:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1050 transitions. [2022-11-22 00:16:07,393 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1050 transitions. Word has length 47 [2022-11-22 00:16:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:07,394 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1050 transitions. [2022-11-22 00:16:07,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1050 transitions. [2022-11-22 00:16:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 00:16:07,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:07,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:07,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-22 00:16:07,401 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1565375413, now seen corresponding path program 1 times [2022-11-22 00:16:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:07,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714781659] [2022-11-22 00:16:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:07,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:07,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714781659] [2022-11-22 00:16:07,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714781659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:07,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:07,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 00:16:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116670985] [2022-11-22 00:16:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:07,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:16:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:16:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:16:07,865 INFO L87 Difference]: Start difference. First operand 718 states and 1050 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:08,944 INFO L93 Difference]: Finished difference Result 1073 states and 1769 transitions. [2022-11-22 00:16:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 00:16:08,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-11-22 00:16:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:08,954 INFO L225 Difference]: With dead ends: 1073 [2022-11-22 00:16:08,954 INFO L226 Difference]: Without dead ends: 1073 [2022-11-22 00:16:08,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-22 00:16:08,955 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 191 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:08,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 2087 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:16:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-11-22 00:16:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 953. [2022-11-22 00:16:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 651 states have (on average 1.4162826420890937) internal successors, (922), 758 states have internal predecessors, (922), 87 states have call successors, (87), 57 states have call predecessors, (87), 111 states have return successors, (501), 137 states have call predecessors, (501), 87 states have call successors, (501) [2022-11-22 00:16:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1510 transitions. [2022-11-22 00:16:09,001 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1510 transitions. Word has length 49 [2022-11-22 00:16:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:09,001 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1510 transitions. [2022-11-22 00:16:09,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:16:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1510 transitions. [2022-11-22 00:16:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 00:16:09,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:09,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:09,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-22 00:16:09,003 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1507151097, now seen corresponding path program 1 times [2022-11-22 00:16:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:09,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031779616] [2022-11-22 00:16:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:10,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031779616] [2022-11-22 00:16:10,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031779616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002857109] [2022-11-22 00:16:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:10,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:10,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:10,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:16:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:10,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-22 00:16:10,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:10,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-22 00:16:10,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-22 00:16:10,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:16:10,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:10,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-22 00:16:10,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:10,983 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 00:16:10,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2022-11-22 00:16:10,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-11-22 00:16:11,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-22 00:16:11,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:11,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-22 00:16:11,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:11,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2022-11-22 00:16:11,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:11,159 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:16:11,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 00:16:11,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-22 00:16:11,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:11,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:11,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:16:11,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-22 00:16:11,438 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array Int Int))) (= (store |c_old(#memory_int)| c_~user~0.base v_ArrVal_1973) |c_#memory_int|)) (exists ((v_ArrVal_1972 Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_~user~0.base (store (select |c_old(#memory_$Pointer$.base)| c_~user~0.base) c_~user~0.offset v_ArrVal_1972))))) is different from true [2022-11-22 00:16:11,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2022-11-22 00:16:11,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-22 00:16:11,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-22 00:16:11,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 00:16:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:11,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:16:11,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002857109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:11,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:16:11,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 27 [2022-11-22 00:16:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206109720] [2022-11-22 00:16:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:11,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 00:16:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:11,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 00:16:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=561, Unknown=1, NotChecked=48, Total=702 [2022-11-22 00:16:11,527 INFO L87 Difference]: Start difference. First operand 953 states and 1510 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:16:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:13,231 INFO L93 Difference]: Finished difference Result 982 states and 1566 transitions. [2022-11-22 00:16:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 00:16:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-22 00:16:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:13,237 INFO L225 Difference]: With dead ends: 982 [2022-11-22 00:16:13,237 INFO L226 Difference]: Without dead ends: 982 [2022-11-22 00:16:13,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=1110, Unknown=12, NotChecked=70, Total=1406 [2022-11-22 00:16:13,238 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 158 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:13,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 2215 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1403 Invalid, 0 Unknown, 408 Unchecked, 1.3s Time] [2022-11-22 00:16:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-11-22 00:16:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 970. [2022-11-22 00:16:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 664 states have (on average 1.408132530120482) internal successors, (935), 769 states have internal predecessors, (935), 87 states have call successors, (87), 57 states have call predecessors, (87), 115 states have return successors, (531), 143 states have call predecessors, (531), 87 states have call successors, (531) [2022-11-22 00:16:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1553 transitions. [2022-11-22 00:16:13,275 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1553 transitions. Word has length 51 [2022-11-22 00:16:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:13,276 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1553 transitions. [2022-11-22 00:16:13,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:16:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1553 transitions. [2022-11-22 00:16:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 00:16:13,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:13,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:13,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:13,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:13,484 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1588240793, now seen corresponding path program 1 times [2022-11-22 00:16:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:13,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027003202] [2022-11-22 00:16:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:16:13,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027003202] [2022-11-22 00:16:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027003202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:13,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:13,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:16:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891248338] [2022-11-22 00:16:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:13,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:16:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:16:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:16:13,864 INFO L87 Difference]: Start difference. First operand 970 states and 1553 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:16:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:14,388 INFO L93 Difference]: Finished difference Result 1050 states and 1739 transitions. [2022-11-22 00:16:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:16:14,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-11-22 00:16:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:14,395 INFO L225 Difference]: With dead ends: 1050 [2022-11-22 00:16:14,395 INFO L226 Difference]: Without dead ends: 1050 [2022-11-22 00:16:14,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:16:14,396 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 41 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:14,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1838 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:16:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2022-11-22 00:16:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1026. [2022-11-22 00:16:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 709 states have (on average 1.4047954866008463) internal successors, (996), 816 states have internal predecessors, (996), 92 states have call successors, (92), 63 states have call predecessors, (92), 121 states have return successors, (569), 146 states have call predecessors, (569), 92 states have call successors, (569) [2022-11-22 00:16:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1657 transitions. [2022-11-22 00:16:14,439 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1657 transitions. Word has length 51 [2022-11-22 00:16:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:14,440 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1657 transitions. [2022-11-22 00:16:14,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:16:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1657 transitions. [2022-11-22 00:16:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-22 00:16:14,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:14,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:14,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-22 00:16:14,441 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:14,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash 396369414, now seen corresponding path program 1 times [2022-11-22 00:16:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:14,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339327147] [2022-11-22 00:16:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 00:16:14,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339327147] [2022-11-22 00:16:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339327147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:14,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:14,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852632047] [2022-11-22 00:16:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:14,543 INFO L87 Difference]: Start difference. First operand 1026 states and 1657 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:16:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:14,860 INFO L93 Difference]: Finished difference Result 1024 states and 1655 transitions. [2022-11-22 00:16:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:14,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-11-22 00:16:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:14,867 INFO L225 Difference]: With dead ends: 1024 [2022-11-22 00:16:14,867 INFO L226 Difference]: Without dead ends: 1024 [2022-11-22 00:16:14,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:14,868 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 33 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:14,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 619 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:16:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-22 00:16:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-22 00:16:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 709 states have (on average 1.4019746121297603) internal successors, (994), 814 states have internal predecessors, (994), 92 states have call successors, (92), 63 states have call predecessors, (92), 121 states have return successors, (569), 146 states have call predecessors, (569), 92 states have call successors, (569) [2022-11-22 00:16:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1655 transitions. [2022-11-22 00:16:14,933 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1655 transitions. Word has length 52 [2022-11-22 00:16:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:14,933 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1655 transitions. [2022-11-22 00:16:14,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:16:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1655 transitions. [2022-11-22 00:16:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-22 00:16:14,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:14,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:14,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-22 00:16:14,936 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-22 00:16:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 396369415, now seen corresponding path program 1 times [2022-11-22 00:16:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:14,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945237370] [2022-11-22 00:16:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:16:14,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:16:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:16:15,064 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:16:15,064 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:16:15,065 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2022-11-22 00:16:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2022-11-22 00:16:15,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2022-11-22 00:16:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2022-11-22 00:16:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2022-11-22 00:16:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2022-11-22 00:16:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2022-11-22 00:16:15,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2022-11-22 00:16:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2022-11-22 00:16:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2022-11-22 00:16:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2022-11-22 00:16:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2022-11-22 00:16:15,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2022-11-22 00:16:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2022-11-22 00:16:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2022-11-22 00:16:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2022-11-22 00:16:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2022-11-22 00:16:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2022-11-22 00:16:15,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2022-11-22 00:16:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2022-11-22 00:16:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2022-11-22 00:16:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2022-11-22 00:16:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2022-11-22 00:16:15,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2022-11-22 00:16:15,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2022-11-22 00:16:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2022-11-22 00:16:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2022-11-22 00:16:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2022-11-22 00:16:15,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2022-11-22 00:16:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2022-11-22 00:16:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2022-11-22 00:16:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2022-11-22 00:16:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2022-11-22 00:16:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2022-11-22 00:16:15,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2022-11-22 00:16:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2022-11-22 00:16:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2022-11-22 00:16:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2022-11-22 00:16:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2022-11-22 00:16:15,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2022-11-22 00:16:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2022-11-22 00:16:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2022-11-22 00:16:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2022-11-22 00:16:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2022-11-22 00:16:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2022-11-22 00:16:15,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2022-11-22 00:16:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2022-11-22 00:16:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2022-11-22 00:16:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2022-11-22 00:16:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2022-11-22 00:16:15,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2022-11-22 00:16:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2022-11-22 00:16:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2022-11-22 00:16:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2022-11-22 00:16:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2022-11-22 00:16:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2022-11-22 00:16:15,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2022-11-22 00:16:15,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2022-11-22 00:16:15,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2022-11-22 00:16:15,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2022-11-22 00:16:15,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2022-11-22 00:16:15,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2022-11-22 00:16:15,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2022-11-22 00:16:15,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2022-11-22 00:16:15,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2022-11-22 00:16:15,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2022-11-22 00:16:15,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2022-11-22 00:16:15,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2022-11-22 00:16:15,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2022-11-22 00:16:15,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2022-11-22 00:16:15,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2022-11-22 00:16:15,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2022-11-22 00:16:15,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2022-11-22 00:16:15,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2022-11-22 00:16:15,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2022-11-22 00:16:15,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2022-11-22 00:16:15,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2022-11-22 00:16:15,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2022-11-22 00:16:15,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2022-11-22 00:16:15,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2022-11-22 00:16:15,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2022-11-22 00:16:15,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2022-11-22 00:16:15,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2022-11-22 00:16:15,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2022-11-22 00:16:15,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2022-11-22 00:16:15,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2022-11-22 00:16:15,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2022-11-22 00:16:15,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2022-11-22 00:16:15,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2022-11-22 00:16:15,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2022-11-22 00:16:15,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2022-11-22 00:16:15,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2022-11-22 00:16:15,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2022-11-22 00:16:15,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2022-11-22 00:16:15,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2022-11-22 00:16:15,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2022-11-22 00:16:15,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2022-11-22 00:16:15,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2022-11-22 00:16:15,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2022-11-22 00:16:15,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2022-11-22 00:16:15,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2022-11-22 00:16:15,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2022-11-22 00:16:15,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2022-11-22 00:16:15,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2022-11-22 00:16:15,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2022-11-22 00:16:15,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2022-11-22 00:16:15,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2022-11-22 00:16:15,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2022-11-22 00:16:15,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2022-11-22 00:16:15,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2022-11-22 00:16:15,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2022-11-22 00:16:15,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2022-11-22 00:16:15,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2022-11-22 00:16:15,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2022-11-22 00:16:15,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2022-11-22 00:16:15,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2022-11-22 00:16:15,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2022-11-22 00:16:15,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2022-11-22 00:16:15,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2022-11-22 00:16:15,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2022-11-22 00:16:15,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2022-11-22 00:16:15,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2022-11-22 00:16:15,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2022-11-22 00:16:15,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2022-11-22 00:16:15,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2022-11-22 00:16:15,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2022-11-22 00:16:15,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2022-11-22 00:16:15,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2022-11-22 00:16:15,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2022-11-22 00:16:15,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2022-11-22 00:16:15,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2022-11-22 00:16:15,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2022-11-22 00:16:15,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2022-11-22 00:16:15,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2022-11-22 00:16:15,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2022-11-22 00:16:15,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2022-11-22 00:16:15,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2022-11-22 00:16:15,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2022-11-22 00:16:15,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2022-11-22 00:16:15,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2022-11-22 00:16:15,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2022-11-22 00:16:15,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2022-11-22 00:16:15,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2022-11-22 00:16:15,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2022-11-22 00:16:15,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2022-11-22 00:16:15,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2022-11-22 00:16:15,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2022-11-22 00:16:15,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2022-11-22 00:16:15,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2022-11-22 00:16:15,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2022-11-22 00:16:15,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2022-11-22 00:16:15,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2022-11-22 00:16:15,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2022-11-22 00:16:15,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2022-11-22 00:16:15,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2022-11-22 00:16:15,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2022-11-22 00:16:15,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2022-11-22 00:16:15,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2022-11-22 00:16:15,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2022-11-22 00:16:15,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2022-11-22 00:16:15,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2022-11-22 00:16:15,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2022-11-22 00:16:15,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-22 00:16:15,104 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:15,110 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:16:15,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:16:15 BoogieIcfgContainer [2022-11-22 00:16:15,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:16:15,178 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:16:15,178 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:16:15,178 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:16:15,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:31" (3/4) ... [2022-11-22 00:16:15,185 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 00:16:15,260 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:16:15,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:16:15,261 INFO L158 Benchmark]: Toolchain (without parser) took 45989.45ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 148.7MB in the beginning and 366.3MB in the end (delta: -217.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,261 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 144.7MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:16:15,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.29ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 122.7MB in the end (delta: 26.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.75ms. Allocated memory is still 182.5MB. Free memory was 122.7MB in the beginning and 119.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,262 INFO L158 Benchmark]: Boogie Preprocessor took 59.15ms. Allocated memory is still 182.5MB. Free memory was 119.8MB in the beginning and 116.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,262 INFO L158 Benchmark]: RCFGBuilder took 1720.60ms. Allocated memory is still 182.5MB. Free memory was 116.5MB in the beginning and 131.5MB in the end (delta: -15.0MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,263 INFO L158 Benchmark]: TraceAbstraction took 43360.35ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 131.5MB in the beginning and 369.4MB in the end (delta: -238.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,263 INFO L158 Benchmark]: Witness Printer took 83.08ms. Allocated memory is still 461.4MB. Free memory was 369.4MB in the beginning and 366.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:15,264 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.31ms. Allocated memory is still 144.7MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.29ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 122.7MB in the end (delta: 26.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.75ms. Allocated memory is still 182.5MB. Free memory was 122.7MB in the beginning and 119.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.15ms. Allocated memory is still 182.5MB. Free memory was 119.8MB in the beginning and 116.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1720.60ms. Allocated memory is still 182.5MB. Free memory was 116.5MB in the beginning and 131.5MB in the end (delta: -15.0MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43360.35ms. Allocated memory was 182.5MB in the beginning and 461.4MB in the end (delta: 278.9MB). Free memory was 131.5MB in the beginning and 369.4MB in the end (delta: -238.0MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 83.08ms. Allocated memory is still 461.4MB. Free memory was 369.4MB in the beginning and 366.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: 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: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L967] user->message.id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L968] EXPR user->info VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}, user->info={7:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L970] user->user_id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; VAL [\old(argc)=79, argc=79, argv={84:81}, argv={84:81}, e={10:0}, user={-1:0}] [L978] e.primitive = _EVENT_START VAL [\old(argc)=79, argc=79, argv={84:81}, argv={84:81}, e={10:0}, user={-1:0}] [L979] CALL event_precess(&e) VAL [e={10:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [e={10:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}, user->status=1] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, status=2, user={-1:0}] [L840] RET status_update(AS_START) VAL [e={10:0}, e={10:0}, primitive=0, status_update(AS_START)=10, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}, user->info={7:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}, user->info={7:0}, user->info->is_valid=0] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [e={9:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [e={9:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-2:0}, primitive=3, rc=-1, user={-1:0}] [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 356 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 40, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5575 SdHoareTripleChecker+Valid, 24.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5538 mSDsluCounter, 43839 SdHoareTripleChecker+Invalid, 20.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 408 IncrementalHoareTripleChecker+Unchecked, 32551 mSDsCounter, 1269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30958 IncrementalHoareTripleChecker+Invalid, 32635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1269 mSolverCounterUnsat, 11288 mSDtfsCounter, 30958 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 321 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=38, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 1100 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1188 ConstructedInterpolants, 2 QuantifiedInterpolants, 6334 SizeOfPredicates, 17 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 40 InterpolantComputations, 39 PerfectInterpolantSequences, 69/70 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 00:16:15,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee506e7-0441-4583-a343-51b52047ca56/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)