./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh --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 6e588807776461813c1ae9106dc80912b11e9df5504cf2f27974dc29a72efbfe --- 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-2329fc7 [2022-12-14 14:31:04,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:31:04,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:31:04,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:31:04,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:31:04,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:31:04,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:31:04,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:31:04,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:31:04,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:31:04,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:31:04,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:31:04,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:31:04,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:31:04,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:31:04,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:31:04,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:31:04,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:31:04,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:31:04,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:31:04,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:31:04,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:31:04,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:31:04,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:31:04,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:31:04,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:31:04,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:31:04,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:31:04,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:31:04,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:31:04,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:31:04,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:31:04,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:31:04,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:31:04,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:31:04,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:31:04,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:31:04,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:31:04,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:31:04,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:31:04,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:31:04,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 14:31:04,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:31:04,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:31:04,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:31:04,900 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:31:04,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:31:04,901 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:31:04,901 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:31:04,901 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:31:04,901 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:31:04,901 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:31:04,901 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:31:04,901 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:31:04,902 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:31:04,902 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:31:04,902 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:31:04,902 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:31:04,902 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:31:04,902 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:31:04,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:31:04,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:31:04,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:31:04,903 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:31:04,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:31:04,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:31:04,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:31:04,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:31:04,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:31:04,906 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_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/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_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh 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 -> 6e588807776461813c1ae9106dc80912b11e9df5504cf2f27974dc29a72efbfe [2022-12-14 14:31:05,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:31:05,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:31:05,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:31:05,089 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:31:05,089 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:31:05,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2022-12-14 14:31:07,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:31:07,786 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:31:07,786 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2022-12-14 14:31:07,792 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/data/fb0db3c0c/2b25ea102ff34eb1a41c96e5cafe627d/FLAG2f1740998 [2022-12-14 14:31:08,181 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/data/fb0db3c0c/2b25ea102ff34eb1a41c96e5cafe627d [2022-12-14 14:31:08,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:31:08,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:31:08,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:31:08,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:31:08,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:31:08,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa6c4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08, skipping insertion in model container [2022-12-14 14:31:08,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:31:08,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:31:08,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:31:08,460 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:31:08,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:31:08,514 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:31:08,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08 WrapperNode [2022-12-14 14:31:08,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:31:08,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:31:08,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:31:08,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:31:08,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,549 INFO L138 Inliner]: procedures = 152, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2022-12-14 14:31:08,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:31:08,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:31:08,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:31:08,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:31:08,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:31:08,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:31:08,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:31:08,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:31:08,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (1/1) ... [2022-12-14 14:31:08,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:31:08,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:08,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:31:08,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:31:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:31:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:31:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:31:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:31:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:31:08,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:31:08,707 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:31:08,709 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:31:08,871 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:31:08,929 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:31:08,930 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 14:31:08,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:31:08 BoogieIcfgContainer [2022-12-14 14:31:08,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:31:08,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:31:08,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:31:08,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:31:08,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:31:08" (1/3) ... [2022-12-14 14:31:08,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4761fc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:31:08, skipping insertion in model container [2022-12-14 14:31:08,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:31:08" (2/3) ... [2022-12-14 14:31:08,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4761fc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:31:08, skipping insertion in model container [2022-12-14 14:31:08,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:31:08" (3/3) ... [2022-12-14 14:31:08,944 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy_malloc.i [2022-12-14 14:31:08,959 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:31:08,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-12-14 14:31:09,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:31:09,016 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;@79a59feb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:31:09,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-12-14 14:31:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 32 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-12-14 14:31:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:31:09,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:09,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:31:09,025 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-12-14 14:31:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 3706, now seen corresponding path program 1 times [2022-12-14 14:31:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:09,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622918452] [2022-12-14 14:31:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:09,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:09,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622918452] [2022-12-14 14:31:09,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622918452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:09,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:09,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:31:09,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752579590] [2022-12-14 14:31:09,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:09,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:31:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:31:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:31:09,305 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 32 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-12-14 14:31:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:09,353 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-12-14 14:31:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:31:09,355 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-12-14 14:31:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:09,361 INFO L225 Difference]: With dead ends: 32 [2022-12-14 14:31:09,361 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 14:31:09,362 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-12-14 14:31:09,366 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:09,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 14:31:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-14 14:31:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-12-14 14:31:09,390 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 2 [2022-12-14 14:31:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:09,391 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-12-14 14:31:09,391 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-12-14 14:31:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-12-14 14:31:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:31:09,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:09,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:31:09,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:31:09,392 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-12-14 14:31:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 3707, now seen corresponding path program 1 times [2022-12-14 14:31:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:09,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967576765] [2022-12-14 14:31:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:09,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:09,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967576765] [2022-12-14 14:31:09,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967576765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:09,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:09,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:31:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605725278] [2022-12-14 14:31:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:09,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:31:09,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:09,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:31:09,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:31:09,573 INFO L87 Difference]: Start difference. First operand 31 states and 33 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-12-14 14:31:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:09,604 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-12-14 14:31:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:31:09,605 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-12-14 14:31:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:09,605 INFO L225 Difference]: With dead ends: 29 [2022-12-14 14:31:09,605 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 14:31:09,606 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-12-14 14:31:09,607 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:09,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 14:31:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-14 14:31:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 28 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-12-14 14:31:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-12-14 14:31:09,611 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 2 [2022-12-14 14:31:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:09,612 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-12-14 14:31:09,612 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-12-14 14:31:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-12-14 14:31:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 14:31:09,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:09,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 14:31:09,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:31:09,613 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-12-14 14:31:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 3622907, now seen corresponding path program 1 times [2022-12-14 14:31:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:09,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728621156] [2022-12-14 14:31:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:09,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:09,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728621156] [2022-12-14 14:31:09,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728621156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:09,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:09,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:31:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176252471] [2022-12-14 14:31:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:09,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:31:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:09,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:31:09,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:31:09,695 INFO L87 Difference]: Start difference. First operand 29 states and 31 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-12-14 14:31:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:09,737 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-12-14 14:31:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:31:09,737 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-12-14 14:31:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:09,737 INFO L225 Difference]: With dead ends: 28 [2022-12-14 14:31:09,738 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 14:31:09,738 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-12-14 14:31:09,739 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:09,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 14:31:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 14:31:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 27 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-12-14 14:31:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-12-14 14:31:09,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 4 [2022-12-14 14:31:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:09,744 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-12-14 14:31:09,744 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-12-14 14:31:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-12-14 14:31:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 14:31:09,744 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:09,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 14:31:09,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:31:09,745 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-12-14 14:31:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:09,745 INFO L85 PathProgramCache]: Analyzing trace with hash 3622908, now seen corresponding path program 1 times [2022-12-14 14:31:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:09,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975950332] [2022-12-14 14:31:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:09,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:09,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975950332] [2022-12-14 14:31:09,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975950332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:09,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:09,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:31:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048981880] [2022-12-14 14:31:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:09,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:31:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:31:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:31:09,891 INFO L87 Difference]: Start difference. First operand 28 states and 30 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-12-14 14:31:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:09,975 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-12-14 14:31:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:31:09,976 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-12-14 14:31:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:09,976 INFO L225 Difference]: With dead ends: 48 [2022-12-14 14:31:09,977 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 14:31:09,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:31:09,978 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:09,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 40 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:31:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 14:31:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 30. [2022-12-14 14:31:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.736842105263158) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-12-14 14:31:09,982 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 4 [2022-12-14 14:31:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:09,983 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-12-14 14:31:09,983 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-12-14 14:31:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-12-14 14:31:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:31:09,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:09,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:31:09,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:31:09,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 112370320, now seen corresponding path program 1 times [2022-12-14 14:31:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:09,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072167991] [2022-12-14 14:31:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:10,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:10,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072167991] [2022-12-14 14:31:10,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072167991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:10,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:10,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:31:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700510811] [2022-12-14 14:31:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:10,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:31:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:31:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:31:10,010 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:10,021 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-12-14 14:31:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:31:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:31:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:10,022 INFO L225 Difference]: With dead ends: 29 [2022-12-14 14:31:10,022 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 14:31:10,023 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-12-14 14:31:10,024 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:10,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 14:31:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-14 14:31:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.6842105263157894) 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-12-14 14:31:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-12-14 14:31:10,027 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 5 [2022-12-14 14:31:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:10,028 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-12-14 14:31:10,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-12-14 14:31:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:31:10,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:10,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:31:10,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:31:10,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 112310119, now seen corresponding path program 1 times [2022-12-14 14:31:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:10,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797005435] [2022-12-14 14:31:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:10,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:10,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797005435] [2022-12-14 14:31:10,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797005435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:10,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:10,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:31:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241465341] [2022-12-14 14:31:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:10,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:31:10,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:31:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:31:10,146 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:10,226 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-12-14 14:31:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:31:10,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:31:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:10,227 INFO L225 Difference]: With dead ends: 28 [2022-12-14 14:31:10,227 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 14:31:10,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:31:10,229 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:10,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 14:31:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 14:31:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.631578947368421) 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-12-14 14:31:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-14 14:31:10,232 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 5 [2022-12-14 14:31:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:10,232 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-14 14:31:10,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-14 14:31:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:31:10,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:10,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:31:10,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:31:10,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 112310120, now seen corresponding path program 1 times [2022-12-14 14:31:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026926310] [2022-12-14 14:31:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:10,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:10,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026926310] [2022-12-14 14:31:10,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026926310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:10,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:10,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:31:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665714980] [2022-12-14 14:31:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:10,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:31:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:10,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:31:10,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:31:10,434 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:10,530 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-12-14 14:31:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:31:10,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:31:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:10,531 INFO L225 Difference]: With dead ends: 43 [2022-12-14 14:31:10,531 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 14:31:10,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:31:10,532 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:10,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 21 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:31:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 14:31:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-12-14 14:31:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.6) 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-12-14 14:31:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-12-14 14:31:10,535 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 5 [2022-12-14 14:31:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:10,535 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-12-14 14:31:10,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-12-14 14:31:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:31:10,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:10,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:31:10,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:31:10,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:10,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash -811487280, now seen corresponding path program 1 times [2022-12-14 14:31:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:10,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501925515] [2022-12-14 14:31:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:10,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501925515] [2022-12-14 14:31:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501925515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:10,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:10,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:31:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824410606] [2022-12-14 14:31:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:10,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:31:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:31:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:31:10,560 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12-14 14:31:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:10,572 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-12-14 14:31:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:31:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-12-14 14:31:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:10,573 INFO L225 Difference]: With dead ends: 28 [2022-12-14 14:31:10,573 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 14:31:10,574 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-12-14 14:31:10,574 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:10,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 14:31:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 14:31:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.55) 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-12-14 14:31:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-14 14:31:10,577 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 6 [2022-12-14 14:31:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:10,577 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-14 14:31:10,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12-14 14:31:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-14 14:31:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 14:31:10,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:10,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:10,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:31:10,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 613698194, now seen corresponding path program 1 times [2022-12-14 14:31:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:10,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454199339] [2022-12-14 14:31:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:10,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:10,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454199339] [2022-12-14 14:31:10,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454199339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:10,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:10,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:31:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694592335] [2022-12-14 14:31:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:31:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:31:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:31:10,624 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-12-14 14:31:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:10,641 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-12-14 14:31:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:31:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-12-14 14:31:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:10,642 INFO L225 Difference]: With dead ends: 28 [2022-12-14 14:31:10,642 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 14:31:10,642 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-12-14 14:31:10,642 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:10,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 14:31:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 14:31:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 27 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-12-14 14:31:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-12-14 14:31:10,645 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 7 [2022-12-14 14:31:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:10,645 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-12-14 14:31:10,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-12-14 14:31:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-12-14 14:31:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:31:10,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:10,646 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:10,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:31:10,646 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash 51256469, now seen corresponding path program 1 times [2022-12-14 14:31:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:10,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46216558] [2022-12-14 14:31:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:10,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:10,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46216558] [2022-12-14 14:31:10,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46216558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:10,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698239645] [2022-12-14 14:31:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:10,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:10,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:31:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:10,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:10,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:10,999 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:31:10,999 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 9 treesize of output 15 [2022-12-14 14:31:11,034 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 13 treesize of output 9 [2022-12-14 14:31:11,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:31:11,130 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 17 treesize of output 15 [2022-12-14 14:31:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:11,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:11,358 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-12-14 14:31:11,365 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 14 treesize of output 12 [2022-12-14 14:31:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:11,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698239645] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:11,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1934475374] [2022-12-14 14:31:11,405 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 14:31:11,405 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:11,408 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:11,412 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:11,413 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:11,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:11,465 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-12-14 14:31:11,494 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-12-14 14:31:11,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:11,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:11,584 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:11,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:11,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:11,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:11,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:11,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:11,692 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:11,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 14:31:11,792 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:31:11,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:31:11,848 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:12,358 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '705#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:12,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:12,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:12,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 14:31:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781603852] [2022-12-14 14:31:12,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 14:31:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 14:31:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:31:12,360 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-12-14 14:31:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:12,633 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-12-14 14:31:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:31:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-12-14 14:31:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:12,635 INFO L225 Difference]: With dead ends: 46 [2022-12-14 14:31:12,635 INFO L226 Difference]: Without dead ends: 46 [2022-12-14 14:31:12,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:31:12,636 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:12,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 166 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:31:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-14 14:31:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-12-14 14:31:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 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-12-14 14:31:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-12-14 14:31:12,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 8 [2022-12-14 14:31:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:12,639 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-12-14 14:31:12,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-12-14 14:31:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-12-14 14:31:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:31:12,639 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:12,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:12,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:31:12,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 14:31:12,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1588398509, now seen corresponding path program 1 times [2022-12-14 14:31:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:12,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764313930] [2022-12-14 14:31:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:12,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:12,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764313930] [2022-12-14 14:31:12,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764313930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:12,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:12,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:31:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098150479] [2022-12-14 14:31:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:12,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:31:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:31:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:31:12,912 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:12,989 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-12-14 14:31:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:31:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 14:31:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:12,990 INFO L225 Difference]: With dead ends: 35 [2022-12-14 14:31:12,990 INFO L226 Difference]: Without dead ends: 35 [2022-12-14 14:31:12,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:31:12,991 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:12,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 51 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:31:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-14 14:31:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-12-14 14:31:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 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-12-14 14:31:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-14 14:31:12,994 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2022-12-14 14:31:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:12,994 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-14 14:31:12,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-14 14:31:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:31:12,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:12,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:12,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:31:12,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1588398510, now seen corresponding path program 1 times [2022-12-14 14:31:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:12,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398752450] [2022-12-14 14:31:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:13,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:13,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398752450] [2022-12-14 14:31:13,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398752450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:13,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:13,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:31:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552887936] [2022-12-14 14:31:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:13,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:31:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:31:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:31:13,293 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:13,576 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-12-14 14:31:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:31:13,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 14:31:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:13,576 INFO L225 Difference]: With dead ends: 33 [2022-12-14 14:31:13,576 INFO L226 Difference]: Without dead ends: 33 [2022-12-14 14:31:13,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:31:13,577 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:13,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 17 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:31:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-14 14:31:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-14 14:31:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 32 states have internal predecessors, (38), 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-12-14 14:31:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-12-14 14:31:13,579 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2022-12-14 14:31:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:13,579 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-12-14 14:31:13,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-12-14 14:31:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:31:13,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:13,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-14 14:31:13,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:31:13,580 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-12-14 14:31:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1588950511, now seen corresponding path program 1 times [2022-12-14 14:31:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:13,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209331157] [2022-12-14 14:31:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:13,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209331157] [2022-12-14 14:31:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209331157] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74287234] [2022-12-14 14:31:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:13,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:13,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:13,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:31:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:13,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 14:31:13,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:13,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:13,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2022-12-14 14:31:13,889 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-12-14 14:31:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:14,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:14,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74287234] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:14,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [991385709] [2022-12-14 14:31:14,171 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 14:31:14,171 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:14,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:14,171 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:14,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:14,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:14,187 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-12-14 14:31:14,211 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-12-14 14:31:14,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:14,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:14,309 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:14,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:14,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:14,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:14,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:14,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:14,433 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:14,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-12-14 14:31:14,522 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:31:14,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:31:14,566 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:15,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1033#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) |ULTIMATE.start_cstrncpy_#t~mem208#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (= |ULTIMATE.start_cstrncpy_~src~0#1.offset| (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (= |ULTIMATE.start_cstrncpy_#t~post207#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|)) (= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrncpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post206#1.offset| 1)) (= (select |#valid| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) 1) (= |ULTIMATE.start_cstrncpy_#t~post206#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:15,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:15,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:15,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-14 14:31:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690046433] [2022-12-14 14:31:15,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:15,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 14:31:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 14:31:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:31:15,040 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 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-12-14 14:31:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:15,436 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-12-14 14:31:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:31:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 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) Word has length 9 [2022-12-14 14:31:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:15,437 INFO L225 Difference]: With dead ends: 53 [2022-12-14 14:31:15,437 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 14:31:15,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:31:15,438 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 298 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:15,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 47 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:31:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 14:31:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2022-12-14 14:31:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 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-12-14 14:31:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-12-14 14:31:15,441 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 9 [2022-12-14 14:31:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:15,441 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-12-14 14:31:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 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-12-14 14:31:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-12-14 14:31:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:31:15,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:15,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:15,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 14:31:15,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:15,644 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1969061031, now seen corresponding path program 1 times [2022-12-14 14:31:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:15,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014451899] [2022-12-14 14:31:15,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:15,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:15,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014451899] [2022-12-14 14:31:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014451899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:15,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039409626] [2022-12-14 14:31:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:15,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:15,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:15,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:31:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:15,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 14:31:15,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:15,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:15,874 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:31:15,874 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 12 treesize of output 11 [2022-12-14 14:31:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039409626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:15,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [863117419] [2022-12-14 14:31:15,882 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 14:31:15,882 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:15,882 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:15,882 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:15,882 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:15,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:15,899 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-12-14 14:31:15,927 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-12-14 14:31:15,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:15,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:15,992 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:15,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:16,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:16,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:16,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:16,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:16,099 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:16,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 14:31:16,157 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:31:16,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:31:16,208 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:16,680 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1203#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (not (= (select |#valid| |ULTIMATE.start_main_~nondetArea~0#1.base|) 1)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n#1| 0) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (= |ULTIMATE.start_cstrncpy_#res#1.offset| |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (= |ULTIMATE.start_cstrncpy_~s1#1.base| |ULTIMATE.start_cstrncpy_#res#1.base|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (not (= |ULTIMATE.start_main_~nondetArea~0#1.base| 0)) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (< |ULTIMATE.start_main_~nondetArea~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.offset|))' at error location [2022-12-14 14:31:16,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:16,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:16,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-12-14 14:31:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950002934] [2022-12-14 14:31:16,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:16,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:31:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:31:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:31:16,682 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:16,709 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-12-14 14:31:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:31:16,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 14:31:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:16,710 INFO L225 Difference]: With dead ends: 31 [2022-12-14 14:31:16,710 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 14:31:16,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:31:16,711 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:16,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 14:31:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-14 14:31:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) 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-12-14 14:31:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-12-14 14:31:16,714 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 11 [2022-12-14 14:31:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:16,714 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-12-14 14:31:16,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-12-14 14:31:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:31:16,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:16,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:16,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:31:16,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 14:31:16,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1968690528, now seen corresponding path program 1 times [2022-12-14 14:31:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397057529] [2022-12-14 14:31:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:16,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:17,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:17,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397057529] [2022-12-14 14:31:17,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397057529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:17,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248469887] [2022-12-14 14:31:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:17,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:17,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:17,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:31:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:17,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 14:31:17,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:17,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:17,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 13 [2022-12-14 14:31:17,488 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-12-14 14:31:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:17,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:18,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248469887] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319171177] [2022-12-14 14:31:18,311 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 14:31:18,311 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:18,311 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:18,312 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:18,312 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:18,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:18,338 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-12-14 14:31:18,354 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-12-14 14:31:18,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:18,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:18,424 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:18,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:18,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:18,496 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:18,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 43 [2022-12-14 14:31:18,569 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 11 treesize of output 7 [2022-12-14 14:31:18,605 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 11 treesize of output 7 [2022-12-14 14:31:18,644 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:20,270 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1376#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:20,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:20,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:20,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:31:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764874648] [2022-12-14 14:31:20,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:20,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:31:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:31:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 14:31:20,273 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-12-14 14:31:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:23,461 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-12-14 14:31:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:31:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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) Word has length 12 [2022-12-14 14:31:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:23,462 INFO L225 Difference]: With dead ends: 127 [2022-12-14 14:31:23,462 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 14:31:23,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=715, Invalid=4255, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 14:31:23,464 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 581 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:23,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 87 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:31:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 14:31:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 43. [2022-12-14 14:31:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 42 states have internal predecessors, (54), 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-12-14 14:31:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-12-14 14:31:23,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 12 [2022-12-14 14:31:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:23,466 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-12-14 14:31:23,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-12-14 14:31:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-12-14 14:31:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:31:23,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:23,466 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1] [2022-12-14 14:31:23,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:31:23,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:31:23,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1590099118, now seen corresponding path program 2 times [2022-12-14 14:31:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:23,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456204732] [2022-12-14 14:31:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:24,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:24,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456204732] [2022-12-14 14:31:24,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456204732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:24,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066115585] [2022-12-14 14:31:24,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:31:24,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:24,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:24,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:31:24,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 14:31:24,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:24,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 14:31:24,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:24,181 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-12-14 14:31:24,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:31:24,305 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 23 treesize of output 23 [2022-12-14 14:31:24,439 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-12-14 14:31:24,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 27 treesize of output 31 [2022-12-14 14:31:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:24,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:25,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:31:25,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 34 [2022-12-14 14:31:25,116 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 34 treesize of output 30 [2022-12-14 14:31:25,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:31:25,132 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 41 treesize of output 45 [2022-12-14 14:31:25,139 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-12-14 14:31:25,145 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 9 treesize of output 7 [2022-12-14 14:31:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:25,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066115585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:25,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1866686373] [2022-12-14 14:31:25,224 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 14:31:25,224 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:25,224 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:25,224 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:25,225 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:25,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:25,246 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-12-14 14:31:25,264 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-12-14 14:31:25,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:25,322 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:25,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:25,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:25,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:25,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:25,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:25,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:25,409 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:25,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-12-14 14:31:25,479 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:31:25,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:31:25,523 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:26,233 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1712#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:26,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:26,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:26,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-14 14:31:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804806549] [2022-12-14 14:31:26,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:26,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:31:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:31:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1214, Unknown=1, NotChecked=0, Total=1332 [2022-12-14 14:31:26,236 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 31 states, 30 states have (on average 1.2) 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-12-14 14:31:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:27,673 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-12-14 14:31:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:31:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2) 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) Word has length 12 [2022-12-14 14:31:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:27,674 INFO L225 Difference]: With dead ends: 86 [2022-12-14 14:31:27,674 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 14:31:27,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=270, Invalid=2081, Unknown=1, NotChecked=0, Total=2352 [2022-12-14 14:31:27,676 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 323 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:27,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 121 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:31:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 14:31:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 43. [2022-12-14 14:31:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.394736842105263) internal successors, (53), 42 states have internal predecessors, (53), 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-12-14 14:31:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-12-14 14:31:27,677 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 12 [2022-12-14 14:31:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:27,678 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-12-14 14:31:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2) 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-12-14 14:31:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-12-14 14:31:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:31:27,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:27,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:27,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:31:27,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:27,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1812929947, now seen corresponding path program 1 times [2022-12-14 14:31:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:27,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779999136] [2022-12-14 14:31:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:31:27,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:27,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779999136] [2022-12-14 14:31:27,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779999136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:27,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:27,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:31:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670289550] [2022-12-14 14:31:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:27,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:31:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:31:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:31:27,902 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:27,912 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-12-14 14:31:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:31:27,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:31:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:27,913 INFO L225 Difference]: With dead ends: 42 [2022-12-14 14:31:27,913 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 14:31:27,913 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-12-14 14:31:27,914 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:27,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 14:31:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-14 14:31:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.368421052631579) internal successors, (52), 41 states have internal predecessors, (52), 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-12-14 14:31:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-12-14 14:31:27,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 13 [2022-12-14 14:31:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:27,916 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-12-14 14:31:27,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-12-14 14:31:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:31:27,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:27,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:27,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 14:31:27,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 366253613, now seen corresponding path program 1 times [2022-12-14 14:31:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:27,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289229998] [2022-12-14 14:31:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:31:27,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:27,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289229998] [2022-12-14 14:31:27,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289229998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:27,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:27,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:31:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250364771] [2022-12-14 14:31:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:27,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:31:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:31:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:31:27,968 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:27,983 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-12-14 14:31:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:31:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 14:31:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:27,984 INFO L225 Difference]: With dead ends: 41 [2022-12-14 14:31:27,984 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 14:31:27,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:31:27,985 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:27,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 11 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 14:31:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-12-14 14:31:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 40 states have internal predecessors, (51), 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-12-14 14:31:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-12-14 14:31:27,987 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 14 [2022-12-14 14:31:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:27,988 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-12-14 14:31:27,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-12-14 14:31:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:31:27,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:27,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:27,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 14:31:27,988 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1531039778, now seen corresponding path program 1 times [2022-12-14 14:31:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:27,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192556211] [2022-12-14 14:31:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:27,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:31:28,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192556211] [2022-12-14 14:31:28,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192556211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:28,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:31:28,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:31:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954393890] [2022-12-14 14:31:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:31:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:31:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:31:28,084 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:28,147 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-12-14 14:31:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:31:28,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 14:31:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:28,148 INFO L225 Difference]: With dead ends: 40 [2022-12-14 14:31:28,148 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 14:31:28,148 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-12-14 14:31:28,149 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 29 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-12-14 14:31:28,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:31:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 14:31:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-14 14:31:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2) internal successors, (36), 31 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-12-14 14:31:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-12-14 14:31:28,151 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2022-12-14 14:31:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:28,151 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-12-14 14:31:28,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-12-14 14:31:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:31:28,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:28,152 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1] [2022-12-14 14:31:28,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 14:31:28,152 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1953507399, now seen corresponding path program 3 times [2022-12-14 14:31:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:28,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825501483] [2022-12-14 14:31:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:28,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:28,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825501483] [2022-12-14 14:31:28,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825501483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:28,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372889697] [2022-12-14 14:31:28,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:31:28,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:28,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:28,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:28,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:31:28,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:31:28,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:28,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 14:31:28,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:28,655 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-12-14 14:31:28,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2022-12-14 14:31:28,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:31:28,808 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 23 treesize of output 23 [2022-12-14 14:31:29,003 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 33 treesize of output 31 [2022-12-14 14:31:29,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:29,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:29,184 INFO L321 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-12-14 14:31:29,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 33 [2022-12-14 14:31:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:29,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:29,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:31:29,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 48 [2022-12-14 14:31:29,929 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 63 treesize of output 57 [2022-12-14 14:31:29,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2022-12-14 14:31:29,969 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 7 treesize of output 3 [2022-12-14 14:31:29,973 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 7 treesize of output 3 [2022-12-14 14:31:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:30,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372889697] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1855076136] [2022-12-14 14:31:30,040 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 14:31:30,040 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:30,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:30,040 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:30,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:30,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,049 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-12-14 14:31:30,075 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-12-14 14:31:30,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:30,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,129 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:30,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:30,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:30,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:30,218 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:30,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-12-14 14:31:30,283 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:31:30,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:31:30,324 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:31,022 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2258#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:31,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:31,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:31,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 40 [2022-12-14 14:31:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481329306] [2022-12-14 14:31:31,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:31,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 14:31:31,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:31,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 14:31:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2063, Unknown=12, NotChecked=0, Total=2256 [2022-12-14 14:31:31,025 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-12-14 14:31:34,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:31:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:38,127 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-12-14 14:31:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:31:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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 16 [2022-12-14 14:31:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:38,128 INFO L225 Difference]: With dead ends: 60 [2022-12-14 14:31:38,128 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 14:31:38,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=474, Invalid=4065, Unknown=17, NotChecked=0, Total=4556 [2022-12-14 14:31:38,129 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 163 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 23 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:38,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 80 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 503 Invalid, 6 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 14:31:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 14:31:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2022-12-14 14:31:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 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-12-14 14:31:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-12-14 14:31:38,131 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 16 [2022-12-14 14:31:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:38,131 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-12-14 14:31:38,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-12-14 14:31:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-12-14 14:31:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:31:38,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:38,132 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:31:38,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 14:31:38,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:38,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:38,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1955475424, now seen corresponding path program 2 times [2022-12-14 14:31:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:38,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440304926] [2022-12-14 14:31:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:39,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:39,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440304926] [2022-12-14 14:31:39,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440304926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043054569] [2022-12-14 14:31:39,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:31:39,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:39,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:39,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:31:39,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 14:31:39,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:39,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-14 14:31:39,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:39,096 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:31:39,097 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 9 treesize of output 15 [2022-12-14 14:31:39,111 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-12-14 14:31:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:39,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:40,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043054569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:40,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2041037346] [2022-12-14 14:31:40,482 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 14:31:40,482 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:40,482 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:40,482 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:40,482 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:40,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:40,495 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-12-14 14:31:40,524 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-12-14 14:31:40,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:40,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:40,588 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:40,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:40,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:40,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:40,679 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:40,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-12-14 14:31:40,739 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 11 treesize of output 7 [2022-12-14 14:31:40,785 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 11 treesize of output 7 [2022-12-14 14:31:40,826 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:42,942 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2547#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:42,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:42,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:42,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 41 [2022-12-14 14:31:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177485009] [2022-12-14 14:31:42,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:42,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 14:31:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 14:31:42,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2449, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 14:31:42,944 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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-12-14 14:31:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:52,166 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-12-14 14:31:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-14 14:31:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 14:31:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:52,167 INFO L225 Difference]: With dead ends: 80 [2022-12-14 14:31:52,167 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 14:31:52,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1588, Invalid=10402, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 14:31:52,169 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 184 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:52,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 25 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:31:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 14:31:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2022-12-14 14:31:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 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-12-14 14:31:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-12-14 14:31:52,171 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2022-12-14 14:31:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:52,171 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-12-14 14:31:52,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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-12-14 14:31:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-12-14 14:31:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:31:52,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:52,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 14:31:52,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 14:31:52,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:52,374 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1498385973, now seen corresponding path program 1 times [2022-12-14 14:31:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306688138] [2022-12-14 14:31:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:52,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306688138] [2022-12-14 14:31:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306688138] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589707145] [2022-12-14 14:31:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:52,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:52,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:52,965 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:52,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:31:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:53,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-14 14:31:53,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:53,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:53,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 13 [2022-12-14 14:31:53,046 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-12-14 14:31:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:53,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:54,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589707145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:31:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1952977487] [2022-12-14 14:31:54,495 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 14:31:54,495 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:31:54,495 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:31:54,495 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:31:54,495 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:54,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:54,518 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-12-14 14:31:54,547 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-12-14 14:31:54,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:54,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:54,606 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:54,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:31:54,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:54,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:54,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:54,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:54,681 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:31:54,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-12-14 14:31:54,742 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:31:54,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:31:54,794 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 11 treesize of output 7 [2022-12-14 14:31:54,846 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 14:31:54,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 113 [2022-12-14 14:31:54,911 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 11 treesize of output 7 [2022-12-14 14:31:54,941 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 11 treesize of output 7 [2022-12-14 14:31:54,968 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:31:56,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2943#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:31:56,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:31:56,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:31:56,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2022-12-14 14:31:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364823159] [2022-12-14 14:31:56,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:31:56,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 14:31:56,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 14:31:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2340, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 14:31:56,129 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 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-12-14 14:31:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:59,013 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-12-14 14:31:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 14:31:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 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 19 [2022-12-14 14:31:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:59,016 INFO L225 Difference]: With dead ends: 49 [2022-12-14 14:31:59,016 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 14:31:59,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=737, Invalid=5115, Unknown=0, NotChecked=0, Total=5852 [2022-12-14 14:31:59,017 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 124 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:59,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 35 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:31:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 14:31:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 14:31:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 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-12-14 14:31:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-12-14 14:31:59,019 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 19 [2022-12-14 14:31:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:59,019 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-12-14 14:31:59,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 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-12-14 14:31:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-12-14 14:31:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:31:59,020 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:59,020 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1] [2022-12-14 14:31:59,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:31:59,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:59,222 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:31:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1814847993, now seen corresponding path program 4 times [2022-12-14 14:31:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:59,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67100163] [2022-12-14 14:31:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:59,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:59,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67100163] [2022-12-14 14:31:59,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67100163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:59,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598921063] [2022-12-14 14:31:59,921 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:31:59,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:59,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:59,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:31:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:59,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-14 14:31:59,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:59,990 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-12-14 14:32:00,028 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-12-14 14:32:00,240 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 26 treesize of output 26 [2022-12-14 14:32:00,576 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 36 treesize of output 34 [2022-12-14 14:32:00,991 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 46 treesize of output 42 [2022-12-14 14:32:01,408 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 56 treesize of output 50 [2022-12-14 14:32:01,876 INFO L321 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2022-12-14 14:32:01,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 61 [2022-12-14 14:32:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:02,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:32:04,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:32:04,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 72 [2022-12-14 14:32:04,491 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 113 treesize of output 103 [2022-12-14 14:32:04,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-12-14 14:32:04,515 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 11 treesize of output 7 [2022-12-14 14:32:04,523 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-12-14 14:32:04,532 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 11 treesize of output 7 [2022-12-14 14:32:04,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 11 treesize of output 7 [2022-12-14 14:32:04,545 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 11 treesize of output 7 [2022-12-14 14:32:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:04,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598921063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:32:04,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926507052] [2022-12-14 14:32:04,689 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 14:32:04,689 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:32:04,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:32:04,689 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:32:04,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:32:04,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:32:04,711 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-12-14 14:32:04,734 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-12-14 14:32:04,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:04,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:32:04,783 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:32:04,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:32:04,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:32:04,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:32:04,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:32:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:32:04,863 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:32:04,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2022-12-14 14:32:04,924 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:32:04,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:32:04,964 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:32:05,855 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3280#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:32:05,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:32:05,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:32:05,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 62 [2022-12-14 14:32:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918522257] [2022-12-14 14:32:05,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:32:05,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-14 14:32:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-14 14:32:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=4499, Unknown=34, NotChecked=0, Total=4830 [2022-12-14 14:32:05,857 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 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-12-14 14:32:28,197 WARN L233 SmtUtils]: Spent 19.72s on a formula simplification. DAG size of input: 144 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:32:44,052 WARN L233 SmtUtils]: Spent 13.42s on a formula simplification. DAG size of input: 175 DAG size of output: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:33:09,179 WARN L233 SmtUtils]: Spent 19.02s on a formula simplification. DAG size of input: 120 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:33:32,486 WARN L233 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 132 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:33:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:33:36,040 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-12-14 14:33:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:33:36,041 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 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 24 [2022-12-14 14:33:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:33:36,041 INFO L225 Difference]: With dead ends: 43 [2022-12-14 14:33:36,041 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 14:33:36,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 93.7s TimeCoverageRelationStatistics Valid=886, Invalid=9357, Unknown=59, NotChecked=0, Total=10302 [2022-12-14 14:33:36,043 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 58 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:33:36,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 891 Invalid, 36 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 14:33:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 14:33:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-12-14 14:33:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-12-14 14:33:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-12-14 14:33:36,044 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 24 [2022-12-14 14:33:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:33:36,044 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-12-14 14:33:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 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-12-14 14:33:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-12-14 14:33:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 14:33:36,045 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:33:36,045 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1] [2022-12-14 14:33:36,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 14:33:36,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:33:36,247 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 14:33:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:33:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 612065117, now seen corresponding path program 5 times [2022-12-14 14:33:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:33:36,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261870864] [2022-12-14 14:33:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:33:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:33:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:33:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:37,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:33:37,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261870864] [2022-12-14 14:33:37,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261870864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:37,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105670778] [2022-12-14 14:33:37,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:33:37,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:33:37,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:33:37,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:33:37,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f605e8-69a7-4ecf-8599-6b23ab790a31/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:33:38,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-14 14:33:38,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:33:38,179 WARN L261 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 223 conjunts are in the unsatisfiable core [2022-12-14 14:33:38,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:33:38,189 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-12-14 14:33:38,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:33:38,431 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 23 treesize of output 23 [2022-12-14 14:33:38,752 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 33 treesize of output 31 [2022-12-14 14:33:39,132 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 41 treesize of output 37 [2022-12-14 14:33:39,590 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 47 treesize of output 41 [2022-12-14 14:33:40,070 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 55 treesize of output 47 [2022-12-14 14:33:40,610 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 65 treesize of output 55 [2022-12-14 14:33:41,239 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 71 treesize of output 59 [2022-12-14 14:33:41,925 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 81 treesize of output 67 [2022-12-14 14:33:42,489 INFO L321 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2022-12-14 14:33:42,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 79 [2022-12-14 14:33:42,494 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 14:33:42,508 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 14:33:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:42,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:53,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:34:53,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 120 [2022-12-14 14:34:53,255 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 213 treesize of output 195 [2022-12-14 14:34:53,260 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 7 treesize of output 3 [2022-12-14 14:34:53,263 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 7 treesize of output 3 [2022-12-14 14:34:53,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 7 treesize of output 3 [2022-12-14 14:34:53,269 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 7 treesize of output 3 [2022-12-14 14:34:53,272 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 7 treesize of output 3 [2022-12-14 14:34:53,275 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 7 treesize of output 3 [2022-12-14 14:34:53,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 148 [2022-12-14 14:34:53,302 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-12-14 14:34:53,373 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 14:34:53,390 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 7 treesize of output 3 [2022-12-14 14:34:53,394 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 7 treesize of output 3 [2022-12-14 14:34:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:53,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105670778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:34:53,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376135681] [2022-12-14 14:34:53,527 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 14:34:53,527 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:34:53,527 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:34:53,527 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:34:53,527 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:34:53,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:53,540 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-12-14 14:34:53,561 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-12-14 14:34:53,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:34:53,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:53,629 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:34:53,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-14 14:34:53,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:53,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:53,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:53,710 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 14:34:53,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-12-14 14:34:53,767 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 14:34:53,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 14:34:53,803 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:34:55,410 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3776#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 14:34:55,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:34:55,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:34:55,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 38, 38] total 106 [2022-12-14 14:34:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633739065] [2022-12-14 14:34:55,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:34:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-14 14:34:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-14 14:34:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=11825, Unknown=287, NotChecked=0, Total=12882 [2022-12-14 14:34:55,414 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 108 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 107 states have internal predecessors, (120), 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-12-14 14:35:05,855 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post207#1.base|))) (let ((.cse1 (= (select .cse0 |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset|) 0)) (.cse6 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse8 (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse13 (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) (.cse7 (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse3 (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse10 (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))) (and (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= (select .cse0 (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (<= |ULTIMATE.start_main_~length~0#1| (select |c_#length| |c_ULTIMATE.start_cstrncpy_#t~post207#1.base|)) (<= 1 |ULTIMATE.start_main_~length~0#1|))) (= |c_ULTIMATE.start_cstrncpy_#t~post207#1.base| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (or .cse1 (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_422))) (or (= (select (select .cse2 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 0) (= (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse3)) (<= .cse5 .cse6)) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (or (<= .cse3 .cse6) (not (<= 0 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) .cse1 (forall ((v_ArrVal_425 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0))) (= |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset| 8) (not (= (select .cse0 0) 0)) (not (= (select .cse0 7) 0)) (not (= (select .cse0 3) 0)) (or (<= .cse7 .cse6) .cse1 (not (<= 0 .cse8)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_420))) (or (= (select (select .cse9 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0))))) (not (= (select .cse0 6) 0)) (or .cse1 (<= (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse6) (not (<= 0 .cse10)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_417))) (or (= (select (select (store .cse11 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_418) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse11 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_419) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 0))))) (or .cse1 (<= .cse8 .cse6) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_423))) (or (= (select (select .cse12 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse4))) (or .cse1 (<= .cse13 .cse6) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_418))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_419) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 0) (= (select (select .cse14 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7) 0)))) (not (<= 0 .cse7))) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (or (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_419))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 0) (= (select (select .cse15 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0)))) (<= .cse10 .cse6) (not (<= 0 .cse5)) .cse1) (not (= (select .cse0 1) 0)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= (+ |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset| 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (not (= (select .cse0 4) 0)) (= |c_ULTIMATE.start_main_~length~0#1| (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 (div |c_ULTIMATE.start_main_~length~0#1| 18446744073709551616)))) (not (= (select .cse0 5) 0)) (or (not (<= 0 .cse13)) .cse1 (<= (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse6) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_416 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_416))) (or (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 0) (= 0 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_419) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_425) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse13) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_418) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 0) (= (select (select .cse16 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10) 0))))) (not (= (select .cse0 2) 0))))) is different from true [2022-12-14 14:38:17,338 WARN L233 SmtUtils]: Spent 2.86m on a formula simplification. DAG size of input: 234 DAG size of output: 218 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:38:19,375 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 [1] [2022-12-14 14:38:20,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:22,571 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 [1] [2022-12-14 14:38:24,915 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 [1] [2022-12-14 14:38:27,143 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 [1] [2022-12-14 14:38:29,365 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 [1] [2022-12-14 14:38:30,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:32,532 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 [1] [2022-12-14 14:38:34,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:35,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:38:37,927 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 [1] [2022-12-14 14:38:40,221 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 [1] [2022-12-14 14:38:42,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:45,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:46,674 WARN L233 SmtUtils]: Spent 1.88m on a formula simplification. DAG size of input: 203 DAG size of output: 184 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:40:48,704 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 [1] [2022-12-14 14:40:50,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:52,812 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 [1] [2022-12-14 14:40:54,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:56,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:44:12,589 WARN L233 SmtUtils]: Spent 2.83m on a formula simplification. DAG size of input: 217 DAG size of output: 194 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:44:15,585 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 [1] [2022-12-14 14:44:16,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:44:19,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:44:21,302 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 [1] [2022-12-14 14:44:22,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:44:24,484 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 [1] [2022-12-14 14:44:25,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:44:28,728 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 [1] [2022-12-14 14:44:29,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:44:32,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:44:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:45:06,097 WARN L233 SmtUtils]: Spent 25.70s on a formula simplification. DAG size of input: 166 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)