./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur --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 64bit --witnessprinter.graph.data.programhash 5142bd1a70b277e6c0e9690abed85caa4ceacf811cc7ce059063d386607411a7 --- 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-38b53e6 [2022-11-25 22:27:07,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:27:07,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:27:07,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:27:07,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:27:07,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:27:07,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:27:07,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:27:07,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:27:07,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:27:07,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:27:07,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:27:07,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:27:07,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:27:07,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:27:07,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:27:07,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:27:07,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:27:07,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:27:07,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:27:07,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:27:07,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:27:07,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:27:07,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:27:07,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:27:07,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:27:07,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:27:07,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:27:07,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:27:07,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:27:07,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:27:07,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:27:07,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:27:07,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:27:07,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:27:07,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:27:07,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:27:07,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:27:07,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:27:07,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:27:07,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:27:07,799 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-25 22:27:07,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:27:07,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:27:07,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:27:07,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:27:07,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:27:07,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:27:07,824 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:27:07,825 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:27:07,825 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:27:07,825 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:27:07,825 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:27:07,825 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:27:07,826 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:27:07,826 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:27:07,826 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:27:07,826 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:27:07,827 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:27:07,827 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:27:07,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:27:07,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:27:07,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:27:07,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:27:07,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:27:07,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:27:07,829 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:27:07,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:27:07,829 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:27:07,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:27:07,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:27:07,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:27:07,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:27:07,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:27:07,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:07,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:27:07,831 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:27:07,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:27:07,831 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:27:07,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:27:07,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:27:07,832 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_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/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_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5142bd1a70b277e6c0e9690abed85caa4ceacf811cc7ce059063d386607411a7 [2022-11-25 22:27:08,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:27:08,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:27:08,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:27:08,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:27:08,105 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:27:08,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i [2022-11-25 22:27:11,227 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:27:11,517 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:27:11,518 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i [2022-11-25 22:27:11,528 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/data/cc7d41316/3f8fa9cc1f514b6da08412818d933f29/FLAG9909b526e [2022-11-25 22:27:11,860 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/data/cc7d41316/3f8fa9cc1f514b6da08412818d933f29 [2022-11-25 22:27:11,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:27:11,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:27:11,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:11,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:27:11,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:27:11,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:11" (1/1) ... [2022-11-25 22:27:11,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b217c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:11, skipping insertion in model container [2022-11-25 22:27:11,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:11" (1/1) ... [2022-11-25 22:27:11,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:27:11,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:27:12,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:12,212 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:27:12,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:12,272 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:27:12,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12 WrapperNode [2022-11-25 22:27:12,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:12,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:12,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:27:12,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:27:12,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,333 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-11-25 22:27:12,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:12,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:27:12,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:27:12,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:27:12,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:27:12,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:27:12,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:27:12,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:27:12,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (1/1) ... [2022-11-25 22:27:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:12,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:27:12,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:27:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:27:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:27:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:27:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:27:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:27:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:27:12,632 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:27:12,634 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:27:12,908 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:27:13,038 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:27:13,038 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 22:27:13,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:27:13 BoogieIcfgContainer [2022-11-25 22:27:13,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:27:13,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:27:13,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:27:13,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:27:13,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:27:11" (1/3) ... [2022-11-25 22:27:13,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0da91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:27:13, skipping insertion in model container [2022-11-25 22:27:13,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:12" (2/3) ... [2022-11-25 22:27:13,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0da91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:27:13, skipping insertion in model container [2022-11-25 22:27:13,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:27:13" (3/3) ... [2022-11-25 22:27:13,051 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-1.i [2022-11-25 22:27:13,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:27:13,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-25 22:27:13,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:27:13,145 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;@5bfd315a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:27:13,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-25 22:27:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 15 states have (on average 2.4) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 22:27:13,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:13,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 22:27:13,157 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash 3923, now seen corresponding path program 1 times [2022-11-25 22:27:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:13,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946586653] [2022-11-25 22:27:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:13,520 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-25 22:27:13,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946586653] [2022-11-25 22:27:13,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946586653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:13,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:13,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:27:13,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586757405] [2022-11-25 22:27:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:13,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:27:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:27:13,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:13,580 INFO L87 Difference]: Start difference. First operand has 31 states, 15 states have (on average 2.4) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:13,670 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-25 22:27:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:27:13,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 22:27:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:13,689 INFO L225 Difference]: With dead ends: 30 [2022-11-25 22:27:13,689 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 22:27:13,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:13,697 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:13,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:27:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 22:27:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-25 22:27:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-25 22:27:13,768 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 2 [2022-11-25 22:27:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:13,769 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-25 22:27:13,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-25 22:27:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 22:27:13,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:13,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 22:27:13,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:27:13,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash 3924, now seen corresponding path program 1 times [2022-11-25 22:27:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:13,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269237771] [2022-11-25 22:27:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:13,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:14,062 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-25 22:27:14,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:14,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269237771] [2022-11-25 22:27:14,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269237771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:14,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:14,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:27:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358883510] [2022-11-25 22:27:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:14,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:27:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:14,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:27:14,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:14,066 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:14,120 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-25 22:27:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:27:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 22:27:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:14,123 INFO L225 Difference]: With dead ends: 28 [2022-11-25 22:27:14,123 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 22:27:14,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:14,130 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:14,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 22:27:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 22:27:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 2.066666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-25 22:27:14,140 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 2 [2022-11-25 22:27:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:14,143 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-25 22:27:14,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-25 22:27:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:27:14,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:14,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:27:14,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:27:14,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:14,152 INFO L85 PathProgramCache]: Analyzing trace with hash 121602, now seen corresponding path program 1 times [2022-11-25 22:27:14,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:14,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898515274] [2022-11-25 22:27:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:14,272 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-25 22:27:14,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:14,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898515274] [2022-11-25 22:27:14,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898515274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:14,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:14,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:27:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105115915] [2022-11-25 22:27:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:14,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:27:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:14,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:27:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:14,276 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:14,307 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-11-25 22:27:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:27:14,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 22:27:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:14,308 INFO L225 Difference]: With dead ends: 27 [2022-11-25 22:27:14,309 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 22:27:14,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:14,310 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:14,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 22:27:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 22:27:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 2.0) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-25 22:27:14,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 3 [2022-11-25 22:27:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:14,315 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-25 22:27:14,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-25 22:27:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 22:27:14,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:14,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 22:27:14,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:27:14,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash 121603, now seen corresponding path program 1 times [2022-11-25 22:27:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:14,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682610094] [2022-11-25 22:27:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:14,448 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-25 22:27:14,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:14,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682610094] [2022-11-25 22:27:14,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682610094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:14,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:14,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:27:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751921123] [2022-11-25 22:27:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:14,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:27:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:27:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:14,452 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:14,484 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-25 22:27:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:27:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 22:27:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:14,485 INFO L225 Difference]: With dead ends: 26 [2022-11-25 22:27:14,485 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 22:27:14,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:14,487 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:14,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 22:27:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-25 22:27:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-25 22:27:14,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 3 [2022-11-25 22:27:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:14,492 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-25 22:27:14,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-25 22:27:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:27:14,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:14,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:27:14,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:27:14,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash 3771797, now seen corresponding path program 1 times [2022-11-25 22:27:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:14,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438641716] [2022-11-25 22:27:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:14,548 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-25 22:27:14,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:14,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438641716] [2022-11-25 22:27:14,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438641716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:14,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:14,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:14,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616209138] [2022-11-25 22:27:14,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:14,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:27:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:27:14,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:27:14,552 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:14,616 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-11-25 22:27:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:27:14,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 22:27:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:14,617 INFO L225 Difference]: With dead ends: 24 [2022-11-25 22:27:14,617 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 22:27:14,618 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-25 22:27:14,619 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:14,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 22:27:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 22:27:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-25 22:27:14,622 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 4 [2022-11-25 22:27:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:14,623 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-25 22:27:14,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-25 22:27:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:27:14,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:14,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:27:14,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:27:14,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 3771798, now seen corresponding path program 1 times [2022-11-25 22:27:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:14,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612235093] [2022-11-25 22:27:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:14,825 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-25 22:27:14,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:14,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612235093] [2022-11-25 22:27:14,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612235093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:14,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:14,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286291093] [2022-11-25 22:27:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:27:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:27:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:27:14,829 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:14,891 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-25 22:27:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:27:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 22:27:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:14,893 INFO L225 Difference]: With dead ends: 43 [2022-11-25 22:27:14,893 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 22:27:14,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:27:14,894 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:14,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 22:27:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-11-25 22:27:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 22:27:14,899 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 4 [2022-11-25 22:27:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:14,899 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 22:27:14,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 22:27:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:27:14,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:14,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:14,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:27:14,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash 696459362, now seen corresponding path program 1 times [2022-11-25 22:27:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:14,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82413025] [2022-11-25 22:27:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:14,960 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-25 22:27:14,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:14,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82413025] [2022-11-25 22:27:14,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82413025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:14,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:14,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167481934] [2022-11-25 22:27:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:27:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:27:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:27:14,964 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:15,009 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-11-25 22:27:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:27:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 22:27:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:15,010 INFO L225 Difference]: With dead ends: 26 [2022-11-25 22:27:15,011 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 22:27:15,011 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-25 22:27:15,012 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:15,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 22:27:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-25 22:27:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-25 22:27:15,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2022-11-25 22:27:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:15,016 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-25 22:27:15,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-25 22:27:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:27:15,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:15,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:15,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:27:15,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 696459363, now seen corresponding path program 1 times [2022-11-25 22:27:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:15,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600915876] [2022-11-25 22:27:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:15,168 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-25 22:27:15,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:15,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600915876] [2022-11-25 22:27:15,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600915876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:15,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:15,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184871048] [2022-11-25 22:27:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:15,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:27:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:27:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:27:15,171 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:15,266 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-11-25 22:27:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:27:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 22:27:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:15,268 INFO L225 Difference]: With dead ends: 37 [2022-11-25 22:27:15,268 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 22:27:15,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:27:15,269 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:15,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:27:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 22:27:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-11-25 22:27:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-25 22:27:15,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-11-25 22:27:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:15,273 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-25 22:27:15,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-25 22:27:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:27:15,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:15,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:15,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:27:15,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 115336708, now seen corresponding path program 1 times [2022-11-25 22:27:15,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:15,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921878134] [2022-11-25 22:27:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:15,421 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-25 22:27:15,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:15,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921878134] [2022-11-25 22:27:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921878134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:15,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:15,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:27:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427319443] [2022-11-25 22:27:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:15,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:27:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:15,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:27:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:27:15,424 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:15,464 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-25 22:27:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:27:15,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:27:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:15,466 INFO L225 Difference]: With dead ends: 28 [2022-11-25 22:27:15,467 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 22:27:15,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:27:15,468 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:15,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 22:27:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-25 22:27:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-25 22:27:15,471 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2022-11-25 22:27:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:15,471 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-25 22:27:15,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-25 22:27:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:27:15,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:15,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:15,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:27:15,484 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash -764729450, now seen corresponding path program 1 times [2022-11-25 22:27:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:15,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002644219] [2022-11-25 22:27:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:15,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002644219] [2022-11-25 22:27:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002644219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:15,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:15,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:27:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542767731] [2022-11-25 22:27:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:27:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:27:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:27:15,516 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:15,535 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-11-25 22:27:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:27:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 22:27:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:15,537 INFO L225 Difference]: With dead ends: 27 [2022-11-25 22:27:15,537 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 22:27:15,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 22:27:15,538 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:15,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:27:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 22:27:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 22:27:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 22:27:15,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2022-11-25 22:27:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:15,542 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 22:27:15,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 22:27:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:27:15,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:15,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:15,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:27:15,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2063036645, now seen corresponding path program 1 times [2022-11-25 22:27:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:15,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590351050] [2022-11-25 22:27:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:15,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590351050] [2022-11-25 22:27:15,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590351050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:27:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612996342] [2022-11-25 22:27:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:15,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:27:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:15,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:27:15,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:27:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:16,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 22:27:16,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:27:16,192 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 14 treesize of output 10 [2022-11-25 22:27:16,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:16,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 29 [2022-11-25 22:27:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:16,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:27:16,893 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 13 treesize of output 11 [2022-11-25 22:27:16,900 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 16 treesize of output 12 [2022-11-25 22:27:16,911 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 22 treesize of output 20 [2022-11-25 22:27:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:16,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612996342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:27:16,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [980541059] [2022-11-25 22:27:16,946 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 22:27:16,946 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:27:16,950 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:27:16,956 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:27:16,956 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:27:17,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:17,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:27:17,055 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 14 treesize of output 10 [2022-11-25 22:27:17,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:17,120 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 25 treesize of output 24 [2022-11-25 22:27:17,511 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:27:20,253 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '721#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:27:20,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:27:20,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:27:20,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-25 22:27:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966765123] [2022-11-25 22:27:20,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:27:20,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 22:27:20,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 22:27:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-11-25 22:27:20,255 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:20,962 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-11-25 22:27:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:27:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:27:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:20,964 INFO L225 Difference]: With dead ends: 44 [2022-11-25 22:27:20,964 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 22:27:20,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 22:27:20,966 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 196 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:20,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 14 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:27:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 22:27:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. [2022-11-25 22:27:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-25 22:27:20,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2022-11-25 22:27:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:20,970 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-25 22:27:20,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-25 22:27:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:27:20,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:20,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:20,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:27:21,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 22:27:21,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash -465631564, now seen corresponding path program 1 times [2022-11-25 22:27:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:21,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126221242] [2022-11-25 22:27:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:21,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:21,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126221242] [2022-11-25 22:27:21,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126221242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:27:21,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:27:21,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:27:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849770409] [2022-11-25 22:27:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:27:21,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:27:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:27:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:27:21,283 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:21,394 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-25 22:27:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:27:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 22:27:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:21,395 INFO L225 Difference]: With dead ends: 26 [2022-11-25 22:27:21,395 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 22:27:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:27:21,396 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:21,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 20 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:27:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 22:27:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 22:27:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-25 22:27:21,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2022-11-25 22:27:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:21,398 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-25 22:27:21,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-25 22:27:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:27:21,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:21,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 22:27:21,399 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1696712637, now seen corresponding path program 1 times [2022-11-25 22:27:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903902479] [2022-11-25 22:27:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:21,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:21,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903902479] [2022-11-25 22:27:21,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903902479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:27:21,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230130783] [2022-11-25 22:27:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:21,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:27:21,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:21,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:27:21,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:27:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:21,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 22:27:21,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:27:21,967 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-25 22:27:22,010 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 14 treesize of output 10 [2022-11-25 22:27:22,076 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 17 treesize of output 19 [2022-11-25 22:27:22,539 INFO L321 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2022-11-25 22:27:22,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2022-11-25 22:27:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:22,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:27:23,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_cstrpbrk_~s~0#1.offset| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22| Int) (v_ArrVal_131 (Array Int Int)) (|ULTIMATE.start_cstrpbrk_~s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_131))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.base|) |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22|))) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22|)) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (= .cse0 0) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22|))))) is different from false [2022-11-25 22:27:23,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:23,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 40 [2022-11-25 22:27:23,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:23,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 114 [2022-11-25 22:27:23,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:23,098 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 64 treesize of output 62 [2022-11-25 22:27:23,109 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 16 treesize of output 12 [2022-11-25 22:27:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:23,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230130783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:27:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [140983442] [2022-11-25 22:27:23,460 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 22:27:23,460 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:27:23,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:27:23,461 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:27:23,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:27:23,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:23,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:27:23,540 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 14 treesize of output 10 [2022-11-25 22:27:23,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:23,581 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 25 treesize of output 24 [2022-11-25 22:27:24,255 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:27:27,810 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '980#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:27:27,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:27:27,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:27:27,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-11-25 22:27:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421186680] [2022-11-25 22:27:27,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:27:27,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 22:27:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:27,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 22:27:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1102, Unknown=1, NotChecked=68, Total=1332 [2022-11-25 22:27:27,813 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:29,760 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-11-25 22:27:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 22:27:29,761 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:27:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:29,762 INFO L225 Difference]: With dead ends: 64 [2022-11-25 22:27:29,762 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 22:27:29,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=500, Invalid=2259, Unknown=1, NotChecked=102, Total=2862 [2022-11-25 22:27:29,764 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 272 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:29,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 29 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 28 Unchecked, 0.3s Time] [2022-11-25 22:27:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 22:27:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-11-25 22:27:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2022-11-25 22:27:29,768 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 13 [2022-11-25 22:27:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:29,768 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2022-11-25 22:27:29,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-11-25 22:27:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:27:29,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:29,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:27:29,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:27:29,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:27:29,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1626058855, now seen corresponding path program 2 times [2022-11-25 22:27:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502752874] [2022-11-25 22:27:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:30,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:30,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502752874] [2022-11-25 22:27:30,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502752874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:27:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099215138] [2022-11-25 22:27:30,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:27:30,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:27:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:30,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:27:30,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:27:30,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 22:27:30,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:27:30,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 22:27:30,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:27:30,871 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-25 22:27:30,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-11-25 22:27:30,919 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 18 treesize of output 14 [2022-11-25 22:27:31,439 INFO L321 Elim1Store]: treesize reduction 18, result has 53.8 percent of original size [2022-11-25 22:27:31,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 32 [2022-11-25 22:27:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:31,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:27:32,051 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 27 treesize of output 23 [2022-11-25 22:27:32,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:32,065 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 35 treesize of output 39 [2022-11-25 22:27:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:32,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099215138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:27:32,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009926051] [2022-11-25 22:27:32,136 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 22:27:32,137 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:27:32,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:27:32,137 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:27:32,137 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:27:32,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:32,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:27:32,190 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 14 treesize of output 10 [2022-11-25 22:27:32,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:32,253 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 25 treesize of output 24 [2022-11-25 22:27:32,477 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:27:35,265 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1250#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:27:35,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:27:35,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:27:35,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 26 [2022-11-25 22:27:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551720867] [2022-11-25 22:27:35,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:27:35,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 22:27:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 22:27:35,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 22:27:35,268 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:27:37,686 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-11-25 22:27:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:27:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 22:27:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:27:37,687 INFO L225 Difference]: With dead ends: 80 [2022-11-25 22:27:37,688 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 22:27:37,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 22:27:37,690 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 165 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:27:37,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 9 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:27:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 22:27:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 32. [2022-11-25 22:27:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-25 22:27:37,693 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2022-11-25 22:27:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:27:37,694 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-25 22:27:37,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:27:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-25 22:27:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 22:27:37,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:27:37,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-25 22:27:37,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:27:37,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:27:37,901 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:27:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:27:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1848408483, now seen corresponding path program 2 times [2022-11-25 22:27:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:27:37,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907668979] [2022-11-25 22:27:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:27:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:27:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:27:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:39,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:27:39,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907668979] [2022-11-25 22:27:39,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907668979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:27:39,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012691490] [2022-11-25 22:27:39,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:27:39,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:27:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:39,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:27:39,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:27:39,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 22:27:39,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:27:39,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-25 22:27:39,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:27:39,230 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 18 treesize of output 16 [2022-11-25 22:27:39,278 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 14 treesize of output 10 [2022-11-25 22:27:39,355 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 17 treesize of output 19 [2022-11-25 22:27:41,359 INFO L321 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2022-11-25 22:27:41,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 60 [2022-11-25 22:27:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:41,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:27:43,378 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32| Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse0 (select v_ArrVal_175 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.offset|))) (= .cse0 0) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31|))) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31|)) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32|))) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31| (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32| 1))) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32| (+ |c_ULTIMATE.start_main_~nondetString1~0#1.offset| 1))) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|))))) is different from false [2022-11-25 22:27:43,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:43,414 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 51 [2022-11-25 22:27:43,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:43,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 133 [2022-11-25 22:27:43,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:27:43,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 106 [2022-11-25 22:27:43,522 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 16 treesize of output 12 [2022-11-25 22:27:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:27:44,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012691490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:27:44,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [990536001] [2022-11-25 22:27:44,111 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 22:27:44,111 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:27:44,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:27:44,112 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:27:44,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:27:44,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:44,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:27:44,168 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 14 treesize of output 10 [2022-11-25 22:27:44,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:27:44,210 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 25 treesize of output 24 [2022-11-25 22:27:44,756 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:27:48,756 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1630#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:27:48,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:27:48,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:27:48,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 48 [2022-11-25 22:27:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834769351] [2022-11-25 22:27:48,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:27:48,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 22:27:48,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:27:48,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 22:27:48,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3276, Unknown=1, NotChecked=116, Total=3660 [2022-11-25 22:27:48,760 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:21,008 INFO L93 Difference]: Finished difference Result 258 states and 292 transitions. [2022-11-25 22:28:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-25 22:28:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 22:28:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:21,010 INFO L225 Difference]: With dead ends: 258 [2022-11-25 22:28:21,010 INFO L226 Difference]: Without dead ends: 258 [2022-11-25 22:28:21,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8106 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=3875, Invalid=20934, Unknown=1, NotChecked=312, Total=25122 [2022-11-25 22:28:21,016 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1632 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:21,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 157 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1049 Invalid, 0 Unknown, 94 Unchecked, 2.0s Time] [2022-11-25 22:28:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-25 22:28:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 89. [2022-11-25 22:28:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2022-11-25 22:28:21,022 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 31 [2022-11-25 22:28:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:21,023 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2022-11-25 22:28:21,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-11-25 22:28:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 22:28:21,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:21,025 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-11-25 22:28:21,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 22:28:21,232 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:28:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1738893657, now seen corresponding path program 1 times [2022-11-25 22:28:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:21,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303189303] [2022-11-25 22:28:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 22:28:22,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303189303] [2022-11-25 22:28:22,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303189303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:28:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481534788] [2022-11-25 22:28:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:22,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:28:22,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:28:22,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 22:28:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:22,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-25 22:28:22,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:22,266 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-25 22:28:22,304 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 14 treesize of output 10 [2022-11-25 22:28:22,366 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 17 treesize of output 19 [2022-11-25 22:28:24,681 INFO L321 Elim1Store]: treesize reduction 11, result has 89.2 percent of original size [2022-11-25 22:28:24,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 114 [2022-11-25 22:28:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:28:24,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:26,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrpbrk_~s~0#1.base_49| Int) (|v_ULTIMATE.start_cstrpbrk_~s~0#1.offset_46| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| Int) (v_ArrVal_198 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_198))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (.cse2 (select v_ArrVal_198 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|)) (.cse1 (select (select .cse3 |v_ULTIMATE.start_cstrpbrk_~s~0#1.base_49|) |v_ULTIMATE.start_cstrpbrk_~s~0#1.offset_46|))) (or (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (select .cse0 (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| 2)) .cse1)) (not (= .cse2 (select .cse0 (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| 1)))) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43|) (= .cse2 0) (not (= (select .cse0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43|) .cse2)) (= .cse1 0) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43|)))))) is different from false [2022-11-25 22:28:26,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:28:26,740 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 70 [2022-11-25 22:28:26,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:28:26,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 171 treesize of output 218 [2022-11-25 22:28:26,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:28:26,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 123 treesize of output 157 [2022-11-25 22:28:26,874 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 16 treesize of output 12 [2022-11-25 22:28:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:28:30,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481534788] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:30,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [700197533] [2022-11-25 22:28:30,005 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 22:28:30,005 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:28:30,006 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:28:30,006 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:28:30,006 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:28:30,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:30,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:28:30,058 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 14 treesize of output 10 [2022-11-25 22:28:30,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:30,095 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 25 treesize of output 24 [2022-11-25 22:28:30,893 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:28:33,342 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2462#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:28:33,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:28:33,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:28:33,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 19] total 47 [2022-11-25 22:28:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515620199] [2022-11-25 22:28:33,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:28:33,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 22:28:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 22:28:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3105, Unknown=1, NotChecked=114, Total=3540 [2022-11-25 22:28:33,346 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 49 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:59,618 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2022-11-25 22:28:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-25 22:28:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-25 22:28:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:59,621 INFO L225 Difference]: With dead ends: 192 [2022-11-25 22:28:59,622 INFO L226 Difference]: Without dead ends: 192 [2022-11-25 22:28:59,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5071 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=2444, Invalid=14329, Unknown=1, NotChecked=256, Total=17030 [2022-11-25 22:28:59,628 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 830 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:59,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 113 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 927 Invalid, 0 Unknown, 81 Unchecked, 1.7s Time] [2022-11-25 22:28:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-25 22:28:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 72. [2022-11-25 22:28:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-11-25 22:28:59,634 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 39 [2022-11-25 22:28:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:59,634 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-11-25 22:28:59,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-11-25 22:28:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 22:28:59,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:59,636 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1] [2022-11-25 22:28:59,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 22:28:59,847 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:28:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1112464918, now seen corresponding path program 2 times [2022-11-25 22:28:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678387144] [2022-11-25 22:28:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:29:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 22:29:01,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:29:01,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678387144] [2022-11-25 22:29:01,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678387144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:29:01,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967608165] [2022-11-25 22:29:01,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:29:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:29:01,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:29:01,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 22:29:01,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 22:29:01,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:29:01,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-25 22:29:01,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:01,678 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-25 22:29:01,716 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 14 treesize of output 10 [2022-11-25 22:29:01,786 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 17 treesize of output 19 [2022-11-25 22:29:05,152 INFO L321 Elim1Store]: treesize reduction 20, result has 77.0 percent of original size [2022-11-25 22:29:05,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 93 [2022-11-25 22:29:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:05,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:09,368 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54| Int) (v_ArrVal_221 (Array Int Int))) (let ((.cse2 (select v_ArrVal_221 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|)) (.cse0 (select v_ArrVal_221 (+ |c_ULTIMATE.start_main_~nondetString2~0#1.offset| 1))) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54| (+ |c_ULTIMATE.start_main_~nondetString1~0#1.offset| 1))) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53|))) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52| (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53| 1))) (= .cse0 0) (not (= .cse2 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52|))) (= .cse2 0) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53| (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54| 1))) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52|)) (not (= .cse2 (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.offset|))) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54|))) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|))))) is different from false [2022-11-25 22:29:09,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:29:09,394 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 68 [2022-11-25 22:29:09,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:29:09,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 201 [2022-11-25 22:29:09,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:29:09,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 199 [2022-11-25 22:29:09,609 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 16 treesize of output 12 [2022-11-25 22:29:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:12,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967608165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337095556] [2022-11-25 22:29:12,265 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 22:29:12,266 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:29:12,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:29:12,266 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:29:12,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:29:12,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:29:12,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:29:12,314 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 14 treesize of output 10 [2022-11-25 22:29:12,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:29:12,359 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 25 treesize of output 24 [2022-11-25 22:29:12,975 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:29:15,996 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3229#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:29:15,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:29:15,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:29:15,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25, 25] total 65 [2022-11-25 22:29:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659112517] [2022-11-25 22:29:15,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:29:15,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-25 22:29:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:29:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-25 22:29:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=5467, Unknown=1, NotChecked=150, Total=6006 [2022-11-25 22:29:16,000 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:30:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:30:39,432 INFO L93 Difference]: Finished difference Result 564 states and 640 transitions. [2022-11-25 22:30:39,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-11-25 22:30:39,433 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-25 22:30:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:30:39,435 INFO L225 Difference]: With dead ends: 564 [2022-11-25 22:30:39,435 INFO L226 Difference]: Without dead ends: 564 [2022-11-25 22:30:39,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 253 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21072 ImplicationChecksByTransitivity, 81.7s TimeCoverageRelationStatistics Valid=7190, Invalid=57075, Unknown=1, NotChecked=504, Total=64770 [2022-11-25 22:30:39,443 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1274 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 5395 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 5714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 5395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:30:39,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 934 Invalid, 5714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 5395 Invalid, 0 Unknown, 249 Unchecked, 9.4s Time] [2022-11-25 22:30:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-25 22:30:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 276. [2022-11-25 22:30:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.1527272727272728) internal successors, (317), 275 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:30:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2022-11-25 22:30:39,458 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 48 [2022-11-25 22:30:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:30:39,458 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2022-11-25 22:30:39,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:30:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2022-11-25 22:30:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 22:30:39,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:30:39,461 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1] [2022-11-25 22:30:39,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:30:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:30:39,667 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:30:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:30:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -810627374, now seen corresponding path program 3 times [2022-11-25 22:30:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:30:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322229425] [2022-11-25 22:30:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:30:39,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:30:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:30:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 22:30:41,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:30:41,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322229425] [2022-11-25 22:30:41,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322229425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:30:41,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596433243] [2022-11-25 22:30:41,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 22:30:41,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:30:41,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:30:41,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:30:41,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 22:30:41,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 22:30:41,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:30:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-25 22:30:41,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:30:41,234 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 18 treesize of output 16 [2022-11-25 22:30:41,274 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 14 treesize of output 10 [2022-11-25 22:30:41,349 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 24 treesize of output 23 [2022-11-25 22:30:45,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:30:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:30:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:30:45,043 INFO L321 Elim1Store]: treesize reduction 20, result has 60.8 percent of original size [2022-11-25 22:30:45,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 60 [2022-11-25 22:30:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:30:45,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:30:48,498 INFO L321 Elim1Store]: treesize reduction 74, result has 40.3 percent of original size [2022-11-25 22:30:48,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 724 treesize of output 558 [2022-11-25 22:30:48,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:30:48,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 514 treesize of output 476 [2022-11-25 22:30:48,539 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 16 treesize of output 12 [2022-11-25 22:30:48,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:30:48,669 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:30:48,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 455 treesize of output 432 [2022-11-25 22:30:48,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:30:48,839 INFO L321 Elim1Store]: treesize reduction 15, result has 88.0 percent of original size [2022-11-25 22:30:48,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 205 treesize of output 259 [2022-11-25 22:30:49,796 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-25 22:30:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:30:49,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596433243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:30:49,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1584722441] [2022-11-25 22:30:49,970 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 22:30:49,970 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:30:49,971 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:30:49,971 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:30:49,971 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:30:49,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:30:49,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:30:50,015 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 14 treesize of output 10 [2022-11-25 22:30:50,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:30:50,047 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 25 treesize of output 24 [2022-11-25 22:30:50,690 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:30:53,786 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4787#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:30:53,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:30:53,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:30:53,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 68 [2022-11-25 22:30:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884607524] [2022-11-25 22:30:53,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:30:53,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-25 22:30:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:30:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-25 22:30:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=5975, Unknown=0, NotChecked=0, Total=6480 [2022-11-25 22:30:53,789 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand has 70 states, 69 states have (on average 2.0) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:32:09,036 INFO L93 Difference]: Finished difference Result 864 states and 987 transitions. [2022-11-25 22:32:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2022-11-25 22:32:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.0) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-25 22:32:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:32:09,040 INFO L225 Difference]: With dead ends: 864 [2022-11-25 22:32:09,040 INFO L226 Difference]: Without dead ends: 864 [2022-11-25 22:32:09,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24234 ImplicationChecksByTransitivity, 76.5s TimeCoverageRelationStatistics Valid=8153, Invalid=63403, Unknown=0, NotChecked=0, Total=71556 [2022-11-25 22:32:09,046 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1622 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 5657 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 5737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:32:09,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1187 Invalid, 5737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5657 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-25 22:32:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-11-25 22:32:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 434. [2022-11-25 22:32:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.1547344110854503) internal successors, (500), 433 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 500 transitions. [2022-11-25 22:32:09,064 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 500 transitions. Word has length 48 [2022-11-25 22:32:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:32:09,064 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 500 transitions. [2022-11-25 22:32:09,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.0) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 500 transitions. [2022-11-25 22:32:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 22:32:09,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:32:09,068 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-11-25 22:32:09,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:32:09,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 22:32:09,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 22:32:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:32:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash -684896319, now seen corresponding path program 4 times [2022-11-25 22:32:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:32:09,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832273078] [2022-11-25 22:32:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:32:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:32:10,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:32:10,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832273078] [2022-11-25 22:32:10,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832273078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:10,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061772643] [2022-11-25 22:32:10,738 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 22:32:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:32:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:32:10,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:32:10,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb1d062-9785-46e7-b7fd-47e23e7538f6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 22:32:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:10,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-25 22:32:10,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:10,873 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-25 22:32:10,914 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 14 treesize of output 10 [2022-11-25 22:32:10,975 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 17 treesize of output 19 [2022-11-25 22:33:15,859 INFO L321 Elim1Store]: treesize reduction 50, result has 79.6 percent of original size [2022-11-25 22:33:15,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 101 treesize of output 228 [2022-11-25 22:33:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 80 refuted. 31 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:33:18,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:22,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:33:22,452 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 115 [2022-11-25 22:33:22,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:33:22,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 298 treesize of output 436 [2022-11-25 22:33:22,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:33:22,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 214 treesize of output 332 [2022-11-25 22:33:22,834 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 16 treesize of output 12 [2022-11-25 22:38:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:38:03,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061772643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:38:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [718113103] [2022-11-25 22:38:03,391 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 22:38:03,391 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:38:03,391 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:38:03,391 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:38:03,391 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:38:03,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:03,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 22:38:03,453 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 14 treesize of output 10 [2022-11-25 22:38:03,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:03,484 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 25 treesize of output 24 [2022-11-25 22:38:04,003 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:38:09,367 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6855#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:38:09,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:38:09,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:38:09,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 28, 28] total 71 [2022-11-25 22:38:09,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467465562] [2022-11-25 22:38:09,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:38:09,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-25 22:38:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:38:09,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-25 22:38:09,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=6428, Unknown=53, NotChecked=0, Total=6972 [2022-11-25 22:38:09,372 INFO L87 Difference]: Start difference. First operand 434 states and 500 transitions. Second operand has 73 states, 72 states have (on average 2.1527777777777777) internal successors, (155), 72 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:38:19,891 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 136 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:38:25,894 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 139 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:38:35,819 WARN L233 SmtUtils]: Spent 9.51s on a formula simplification. DAG size of input: 184 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:38:43,590 WARN L233 SmtUtils]: Spent 7.59s on a formula simplification. DAG size of input: 186 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:38:52,546 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 191 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:00,082 WARN L233 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 130 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:06,453 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 194 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:14,830 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 133 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:23,198 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 189 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:29,631 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 175 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:36,693 WARN L233 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 185 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:45,145 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 179 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:51,641 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 176 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:00,382 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 190 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:07,027 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 184 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:09,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:11,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:20,582 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 135 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:27,537 WARN L233 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 185 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:29,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:37,338 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 180 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:38,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:40:44,922 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 173 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:40:46,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:41:00,034 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 115 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:41:09,366 WARN L233 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 155 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:41:16,240 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 179 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:41:18,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]